{"paper_id":"2511.00018","title":"Branched Signature Model","authors":["Munawar Ali","Qi Feng"],"paper_date":"2025-10-23","paper_type":"theoretical","paper_url":"https://arxiv.org/pdf/2511.00018v1","page_url":"https://thequant.space/flowcharts/branched-signature-model/","scores":{"empirical_rigor":2,"math_complexity":9,"quadrant":"Lab Rats"},"proposes":{"status":"available","statement":"The paper proposes the branched signature model, including an explicit construction of an extended path via a map Ψ that realizes the branched signature as a classical geometric signature, and presents an algorithm for learning the extended path.","quote":"In this paper, we introduce the branched signature model, motivated by the branched rough path framework of [Gubinelli, Journal of Differential Equations, 248(4), 2010], which generalizes the classical geometric rough path. 1 (2015)], we show how to explicitly construct the extension of the original paths into higher-dimensional spaces via a map $Ψ$, so that the branched signature can be realized as the classical","summary":"In this paper, we introduce the branched signature model, motivated by the branched rough path framework of [“Gubinelli, Journal of Differential Equations, 248(4), 2010”], which generalizes the classical geometric rough path. We establish a universal approximation theorem for the branched signature…","strategy":null},"assumptions":{"status":"available","items":[{"assumption":"The underlying paths X are continuous α‑Hölder paths with α > 1/4.","type":"model","stated":"explicit","quote":"To acquire this result, we enhance the path X : [0, T] →Rd with an additional time component and denote it by bX : [0, T] →Rd+1 defined by bX := (t, X). Let X : [0, T] →Rd be an α-Hölder path with α ∈ \u0000 1 4, 1 3 \u0003 .","support":"full"},{"assumption":"Time‑augmented paths bX(t) = (t, X_t) are used to ensure uniqueness of signatures.","type":"model","stated":"explicit","quote":"To acquire this result, we enhance the path X : [0, T] →Rd with an additional time component and denote it by bX : [0, T] →Rd+1 defined by bX := (t, X). Form the time-augmented paths bX(t) := (t, Xt) and bY(t) := (t, Yt) in R1+d.","support":"full"},{"assumption":"Iterated integrals involving a time component are defined in the Young sense.","type":"statistical","stated":"explicit","quote":"The iterated integrals with a component of time can be defined in the sense of Young’s. Lemma 3.5 (Uniqueness of the branched signature).","support":"full"}]},"datasets":{"status":"available","items":[{"name":"Simulated Brownian motion paths","provider":null,"kind":"synthetic","access":"unknown","period":null,"universe":null,"quote":"We simulate paths of Brownian motion Bt and fractional Brownian motion BH t with Hurst parameter H = 0.1 of a length N with N = 1000 on the interval [0, 1].","support":"full"},{"name":"Simulated fractional Brownian motion paths (H=0.1)","provider":null,"kind":"synthetic","access":"unknown","period":null,"universe":null,"quote":"We simulate paths of Brownian motion Bt and fractional Brownian motion BH t with Hurst parameter H = 0.1 of a length N with N = 1000 on the interval [0, 1]. Fractional Brownian motion path is simulated using Davies-Harte method [Davies and Harte, 1987] and the choice of Hurst parameter is motivated by the study done in [Gatheral et al., 2022].","support":"full"}],"known":[],"sample":{"start":null,"end":null,"market":null,"asset_class":null,"frequency":null},"data_resolution":"synthetic"},"transaction_costs":{"status":"not_applicable","modeled":"n/a","headline_net_of_costs":null,"detail":null,"quote":null,"source":"front_matter","rule":"R3","candidates":{"front_matter":"n/a","evidence_card":"n/a","evidence_card_quoted":false},"meaning":"the paper reports no trading or execution result"},"results":{"status":"available","evaluation_type":"unclear","findings":[{"finding":"A universal approximation theorem for the branched signature model is established, showing that iterative compositions of lower‑level signature maps can approximate higher‑level signatures.","kind":"theoretical","quote":"We establish a universal approximation theorem for the branched signature model and demonstrate that iterative compositions of lower-level signature maps can approximate higher-level signatures.","support":"full"},{"finding":"The branched signature can be realized as the classical geometric signature of an explicitly constructed extended path, providing an efficient computational scheme.","kind":"theoretical","quote":"1 (2015)], we show how to explicitly construct the extension of the original paths into higher-dimensional spaces via a map $Ψ$, so that the branched signature can be realized as the classical geometric signature of the extended path. This framework not only provides an efficient computational scheme for branched signatures but also opens new avenues for data-driven modeling and applications.","support":"full"},{"finding":"Uniqueness lemmas for both classical and branched signatures are proved using time‑extended paths.","kind":"theoretical","quote":"Assume their (geometric) terminal signatures coincide at all levels i.e., Sig( bX)0,T = Sig( bY)0,T . Then Xt = Yt for all t ∈[0, T].","support":"full"}],"reported_performance":null,"out_of_sample":{"method":"none","headline_out_of_sample":null}},"independent_evidence":{"status":"none_found","supports":[],"contradicts":[],"qualifies":[],"compared_with":5,"citations":{"cited_by_in_corpus":0,"by_independent_authors":0,"how_cited":{"used_as_baseline":0,"uses_method_or_data":0,"extends":0,"discusses_findings":0,"mentions":0,"unclassified":0},"independent_papers":[],"scope":"Citations between papers in this corpus only; citations from outside it are not counted."}},"implementation":{"status":"available","public":false,"code_url":null,"note":"No repository presented by the authors as their own was found in the paper. Absence here is not proof that no code exists."},"replication":{"status":"none_found","card":null,"note":"No replication of this paper has been run by thequant.space yet."},"extraction":{"text_source":"fulltext","model":"openai/gpt-oss-120b","version":2,"extracted_at":"2026-11-14T19:46:49Z"},"provenance":{"claims":"Everything here is what the authors state in the paper. Nothing was re-run or reproduced by the platform.","quotes":"Assumptions, datasets, cost detail and findings were extracted by a language model. Every quote is verbatim paper text. Where an item has `support`, \"full\" means every figure in it appears in the quoted sentences and \"partial\" means a figure is stated elsewhere in the paper; items with a figure found nowhere in the paper were discarded.","datasets_known":"datasets.known lists well-known vendors and public datasets by a stable id, found by a dictionary over the full text where the sentence says the data is used; it is independent of the model and covers only names in the dictionary.","flags":"transaction_costs.modeled, results.evaluation_type and results.out_of_sample.method are platform classifications (structured-decision models); see https://thequant.space/score-guide/#penalty-flags","comparisons":"supports / contradicts / qualifies are a language model's reading of two papers' quoted findings, restricted to closely related papers that share no author. They are pointers to read, not verified replications, and coverage is partial.","implementation":"code_url is a repository the paper itself presents as its own (rule-scored, ambiguous cases judged by a model), checked for liveness when it was recorded."},"docs":"https://thequant.space/agents/"}