{"as_of":"2026-08-15T14:47:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:277f7ea025d15a7f9ebc02f16dad925704c04e288ca26b54bf21919e2fc6b2d9","coverage":[{"denominator":300,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":100,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T00:35:54.768938Z","state":"measured"},{"denominator":100,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":100,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2608.07724/citation-record","integrity":"/paper/2608.07724/integrity","json":"/paper/2608.07724/citation-record.json","paper":"/paper/2608.07724"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:35:54.305324Z","title":null,"venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2608.07724","last_updated":"2026-08-07T19:28:37Z","snapshot_observed_at":"2026-08-14T21:45:01.249275Z","submitted_at":"2026-08-07T19:28:37Z","title":"Communication-efficient parallel Bruhat decomposition","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-11T00:35:54.305324Z"},"links":{"citing_paper":"/paper/2608.07724"},"observation_digest":"sha256:18a917d893917b73d0f269b9ce00faf1665723cb394f8e725ea309baf1e72a37","observation_id":"531efe37-f241-41dc-9e15-888ca7d83882","resolution":{"observed_at":"2026-08-11T00:35:54.305324Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:35:54.310803Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.07724","last_updated":"2026-08-07T19:28:37Z","snapshot_observed_at":"2026-08-14T21:45:01.249275Z","submitted_at":"2026-08-07T19:28:37Z","title":"Communication-efficient parallel Bruhat decomposition","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-11T00:35:54.310803Z"},"links":{"citing_paper":"/paper/2608.07724"},"observation_digest":"sha256:8dfcbda8d4341a8d134d50daf52bdf85c66a7044742dd1ccfa7f64e9f6d7d841","observation_id":"c1a0205d-28d4-4537-8526-afcc88613284","resolution":{"observed_at":"2026-08-11T00:35:54.310803Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:35:54.315700Z","title":null,"venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2608.07724","last_updated":"2026-08-07T19:28:37Z","snapshot_observed_at":"2026-08-14T21:45:01.249275Z","submitted_at":"2026-08-07T19:28:37Z","title":"Communication-efficient parallel Bruhat decomposition","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-11T00:35:54.315700Z"},"links":{"citing_paper":"/paper/2608.07724"},"observation_digest":"sha256:3a69369c49cadcc89d4285b13cd37f7845ecdff368c567b512825db0f5393853","observation_id":"38d819de-c140-4f0a-b650-f6be1881a46b","resolution":{"observed_at":"2026-08-11T00:35:54.315700Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:35:54.320582Z","title":null,"venue":null,"work_id":null,"year":1969},"citing_paper":{"arxiv_id":"2608.07724","last_updated":"2026-08-07T19:28:37Z","snapshot_observed_at":"2026-08-14T21:45:01.249275Z","submitted_at":"2026-08-07T19:28:37Z","title":"Communication-efficient parallel Bruhat decomposition","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-11T00:35:54.320582Z"},"links":{"citing_paper":"/paper/2608.07724"},"observation_digest":"sha256:e8482650362e4e90e0fbcc1b085bd82fb6e0074b639c65bf29d8452ed47b9f16","observation_id":"0aa6265d-6aea-4fe5-818e-844b41b35021","resolution":{"observed_at":"2026-08-11T00:35:54.320582Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:35:54.325391Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.07724","last_updated":"2026-08-07T19:28:37Z","snapshot_observed_at":"2026-08-14T21:45:01.249275Z","submitted_at":"2026-08-07T19:28:37Z","title":"Communication-efficient parallel Bruhat decomposition","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-11T00:35:54.325391Z"},"links":{"citing_paper":"/paper/2608.07724"},"observation_digest":"sha256:fa22618e2fbd306fe3bb194cb687842af407a32da5cc0d901555dd27630e3bc7","observation_id":"c6aa7b36-fc51-419f-b897-9a4a486e5a34","resolution":{"observed_at":"2026-08-11T00:35:54.325391Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:35:54.330421Z","title":"Grigoriev Analogy of Bruhat decomposition for the closure of a cone of Chevalley group of a classical series, Soviet Mathematics Doklady, 23 (2) (1981), pp","venue":null,"work_id":null,"year":1981},"citing_paper":{"arxiv_id":"2608.07724","last_updated":"2026-08-07T19:28:37Z","snapshot_observed_at":"2026-08-14T21:45:01.249275Z","submitted_at":"2026-08-07T19:28:37Z","title":"Communication-efficient parallel Bruhat decomposition","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-11T00:35:54.330421Z"},"links":{"citing_paper":"/paper/2608.07724"},"observation_digest":"sha256:a5acddf5c9aa0614943bcf2ade1f89c067711f2c9538688557ee6fcafe866754","observation_id":"6ac8a1df-b9a0-4163-adf4-833badebf97c","resolution":{"observed_at":"2026-08-11T00:35:54.330421Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:35:54.335322Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.07724","last_updated":"2026-08-07T19:28:37Z","snapshot_observed_at":"2026-08-14T21:45:01.249275Z","submitted_at":"2026-08-07T19:28:37Z","title":"Communication-efficient parallel Bruhat decomposition","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-11T00:35:54.335322Z"},"links":{"citing_paper":"/paper/2608.07724"},"observation_digest":"sha256:9b94f1686f4277e04fa402794d083bfaa675a50a46f31bf1b8ce1afff3e08a1a","observation_id":"831687bf-7d51-400f-b563-7a691c2c66f3","resolution":{"observed_at":"2026-08-11T00:35:54.335322Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:35:54.340007Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.07724","last_updated":"2026-08-07T19:28:37Z","snapshot_observed_at":"2026-08-14T21:45:01.249275Z","submitted_at":"2026-08-07T19:28:37Z","title":"Communication-efficient parallel Bruhat decomposition","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-11T00:35:54.340007Z"},"links":{"citing_paper":"/paper/2608.07724"},"observation_digest":"sha256:be8b26782671e1908780ce398467bcef4ccc0d9c5a80705b12e61b293fbd60b9","observation_id":"b13550a0-e13f-4849-92ab-0fc60aaadafd","resolution":{"observed_at":"2026-08-11T00:35:54.340007Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:35:54.344828Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.07724","last_updated":"2026-08-07T19:28:37Z","snapshot_observed_at":"2026-08-14T21:45:01.249275Z","submitted_at":"2026-08-07T19:28:37Z","title":"Communication-efficient parallel Bruhat decomposition","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-11T00:35:54.344828Z"},"links":{"citing_paper":"/paper/2608.07724"},"observation_digest":"sha256:0c542b41d2cd1220c1ce94bb16bbc2a6d046f55e13c3fffffc53aa28f44ec2ec","observation_id":"c798b3a2-917b-4591-ae4d-7422736d89c1","resolution":{"observed_at":"2026-08-11T00:35:54.344828Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:35:54.349668Z","title":"doi:10.1007/BF02579338 , journal =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.07724","last_updated":"2026-08-07T19:28:37Z","snapshot_observed_at":"2026-08-14T21:45:01.249275Z","submitted_at":"2026-08-07T19:28:37Z","title":"Communication-efficient parallel Bruhat decomposition","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-11T00:35:54.349668Z"},"links":{"citing_paper":"/paper/2608.07724"},"observation_digest":"sha256:29bd3fc682b14c01015a419608d8bfcd2bf7912ab9fadfa0918746b251dbc1dc","observation_id":"62b783a8-aa8d-4dcf-8aaf-263c87e9f31b","resolution":{"observed_at":"2026-08-11T00:35:54.349668Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1110.0160","last_updated":"2012-11-20T02:14:23Z","snapshot_observed_at":"2026-08-15T04:33:31.623244Z","submitted_at":"2011-10-02T09:05:47Z","title":"A pattern theorem for random sorting networks","version":2},"cited_work":{"arxiv_id":"1110.0160","doi":null,"metadata_source":"pith","pith_arxiv_id":"1110.0160","snapshot_observed_at":"2026-08-11T00:35:58.266969Z","title":"A pattern theorem for random sorting networks","venue":"math.PR","work_id":"4013b253-cb10-4381-908d-d4396906a952","year":2011},"citing_paper":{"arxiv_id":"2608.07724","last_updated":"2026-08-07T19:28:37Z","snapshot_observed_at":"2026-08-14T21:45:01.249275Z","submitted_at":"2026-08-07T19:28:37Z","title":"Communication-efficient parallel Bruhat decomposition","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-11T00:35:54.355165Z"},"links":{"cited_paper":"/paper/1110.0160","citing_paper":"/paper/2608.07724"},"observation_digest":"sha256:4f4b413c9de29776339e9984ea9df815754aecde717e9412683f1d039fe0eee1","observation_id":"06754453-4296-4460-80e9-4a93a3e09135","resolution":{"observed_at":"2026-08-11T00:35:58.273021Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:35:54.360442Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.07724","last_updated":"2026-08-07T19:28:37Z","snapshot_observed_at":"2026-08-14T21:45:01.249275Z","submitted_at":"2026-08-07T19:28:37Z","title":"Communication-efficient parallel Bruhat decomposition","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-11T00:35:54.360442Z"},"links":{"citing_paper":"/paper/2608.07724"},"observation_digest":"sha256:ad42b0de8d6dd90f617b99bb62af47ffe67d52ecad4f500ba7dd92fbd20bc6cc","observation_id":"89b0ae42-31c5-409c-bda6-b4bfc4d3e1e7","resolution":{"observed_at":"2026-08-11T00:35:54.360442Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:35:54.365075Z","title":"and Ziv-Ukelson, Michal , doi =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.07724","last_updated":"2026-08-07T19:28:37Z","snapshot_observed_at":"2026-08-14T21:45:01.249275Z","submitted_at":"2026-08-07T19:28:37Z","title":"Communication-efficient parallel Bruhat decomposition","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-11T00:35:54.365075Z"},"links":{"citing_paper":"/paper/2608.07724"},"observation_digest":"sha256:5010cbd5212e8f292e71b3e665dada9f377a6d86fdf25878a0923bc97140c462","observation_id":"f3dac243-a647-41ae-9316-3ea3e78bce5f","resolution":{"observed_at":"2026-08-11T00:35:54.365075Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:35:54.370094Z","title":"and Zeilberger, Doron , eprint =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.07724","last_updated":"2026-08-07T19:28:37Z","snapshot_observed_at":"2026-08-14T21:45:01.249275Z","submitted_at":"2026-08-07T19:28:37Z","title":"Communication-efficient parallel Bruhat decomposition","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-11T00:35:54.370094Z"},"links":{"citing_paper":"/paper/2608.07724"},"observation_digest":"sha256:0812c4d10dd9a9454cd04d3d8c038cc5abdf5314dee3cc38724817cae2b12fa8","observation_id":"7edad8aa-b048-45e1-8171-ba91cf82394a","resolution":{"observed_at":"2026-08-11T00:35:54.370094Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:35:54.374915Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.07724","last_updated":"2026-08-07T19:28:37Z","snapshot_observed_at":"2026-08-14T21:45:01.249275Z","submitted_at":"2026-08-07T19:28:37Z","title":"Communication-efficient parallel Bruhat decomposition","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-11T00:35:54.374915Z"},"links":{"citing_paper":"/paper/2608.07724"},"observation_digest":"sha256:5b92910eac18459e008a4e875827b4d302b3ebb0be47b3ee72eda4845ac1d805","observation_id":"ddb149dc-7795-427a-8367-0a54c9a33332","resolution":{"observed_at":"2026-08-11T00:35:54.374915Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/s0097539702408223","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:35:56.806957Z","title":"doi:10.1137/S0097539702408223 , journal =","venue":null,"work_id":"b0a1907b-88df-425e-bc4b-d3962f093add","year":null},"citing_paper":{"arxiv_id":"2608.07724","last_updated":"2026-08-07T19:28:37Z","snapshot_observed_at":"2026-08-14T21:45:01.249275Z","submitted_at":"2026-08-07T19:28:37Z","title":"Communication-efficient parallel Bruhat decomposition","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-11T00:35:54.379401Z"},"links":{"citing_paper":"/paper/2608.07724"},"observation_digest":"sha256:7516aae81e943ea8aa74698baa0f717e2aa23c47cc7e20ada36b094e5364fffa","observation_id":"13843523-5806-47c0-9344-eca73978badf","resolution":{"observed_at":"2026-08-11T00:35:56.812218Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-11T01:08:28.292044+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-11T01:08:28.292044+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:35:54.384244Z","title":", booktitle =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.07724","last_updated":"2026-08-07T19:28:37Z","snapshot_observed_at":"2026-08-14T21:45:01.249275Z","submitted_at":"2026-08-07T19:28:37Z","title":"Communication-efficient parallel Bruhat decomposition","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-11T00:35:54.384244Z"},"links":{"citing_paper":"/paper/2608.07724"},"observation_digest":"sha256:e09d2293d94066e67fd79c76f2054d4d127759955104cc59a8ffe42b73fc9ee7","observation_id":"69f106c9-7126-4bc6-81c5-3ac97858395e","resolution":{"observed_at":"2026-08-11T00:35:54.384244Z","resolver_source":null,"status":"parse_uncertain"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:35:54.388838Z","title":"ACM Computing Surveys , number =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.07724","last_updated":"2026-08-07T19:28:37Z","snapshot_observed_at":"2026-08-14T21:45:01.249275Z","submitted_at":"2026-08-07T19:28:37Z","title":"Communication-efficient parallel Bruhat decomposition","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-11T00:35:54.388838Z"},"links":{"citing_paper":"/paper/2608.07724"},"observation_digest":"sha256:edebb873b7b9ce4ad857bbf3ba3932ca64d2c952105fa775c31f41a0258f36ec","observation_id":"9842eb23-3ccc-45f4-a5ff-f1dae257d3f7","resolution":{"observed_at":"2026-08-11T00:35:54.388838Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:35:54.393555Z","title":"Linear Algebra and its Applications , pages =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.07724","last_updated":"2026-08-07T19:28:37Z","snapshot_observed_at":"2026-08-14T21:45:01.249275Z","submitted_at":"2026-08-07T19:28:37Z","title":"Communication-efficient parallel Bruhat decomposition","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-11T00:35:54.393555Z"},"links":{"citing_paper":"/paper/2608.07724"},"observation_digest":"sha256:dcf89de8b33bc714c20a8c554f85206afeb4ecca9d7bba702332d968a54e0a9e","observation_id":"f60264a0-5430-4510-9326-ae9ad0bdc5d0","resolution":{"observed_at":"2026-08-11T00:35:54.393555Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:35:54.398074Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.07724","last_updated":"2026-08-07T19:28:37Z","snapshot_observed_at":"2026-08-14T21:45:01.249275Z","submitted_at":"2026-08-07T19:28:37Z","title":"Communication-efficient parallel Bruhat decomposition","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-11T00:35:54.398074Z"},"links":{"citing_paper":"/paper/2608.07724"},"observation_digest":"sha256:ec7edcfe66bf1ef8356b540a40f0d4d79268ba44ce9f16066ab94c5df8f910cf","observation_id":"9ccc55ab-ec53-4882-9a4a-36d90571491f","resolution":{"observed_at":"2026-08-11T00:35:54.398074Z","resolver_source":null,"status":"parse_uncertain"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:35:54.402999Z","title":"Journal of Parallel and Distributed Computing , number =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.07724","last_updated":"2026-08-07T19:28:37Z","snapshot_observed_at":"2026-08-14T21:45:01.249275Z","submitted_at":"2026-08-07T19:28:37Z","title":"Communication-efficient parallel Bruhat decomposition","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-11T00:35:54.402999Z"},"links":{"citing_paper":"/paper/2608.07724"},"observation_digest":"sha256:5cdbbef2bf05c161fdbb37dea535d8bc75760e263912174cd4eee2340fcd1884","observation_id":"e1a692bc-7821-4aa0-9c4b-c3d74713ecab","resolution":{"observed_at":"2026-08-11T00:35:54.402999Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:35:54.407592Z","title":"Journal of the ACM , number =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.07724","last_updated":"2026-08-07T19:28:37Z","snapshot_observed_at":"2026-08-14T21:45:01.249275Z","submitted_at":"2026-08-07T19:28:37Z","title":"Communication-efficient parallel Bruhat decomposition","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-11T00:35:54.407592Z"},"links":{"citing_paper":"/paper/2608.07724"},"observation_digest":"sha256:99fce9a9c9a459c6ac83ec8b4222d4544e80bca818809735b12b8185d061e5e4","observation_id":"f4447361-ea96-4393-9570-70de47b4fb5c","resolution":{"observed_at":"2026-08-11T00:35:54.407592Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:35:54.412020Z","title":"Algorithms , number =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.07724","last_updated":"2026-08-07T19:28:37Z","snapshot_observed_at":"2026-08-14T21:45:01.249275Z","submitted_at":"2026-08-07T19:28:37Z","title":"Communication-efficient parallel Bruhat decomposition","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-11T00:35:54.412020Z"},"links":{"citing_paper":"/paper/2608.07724"},"observation_digest":"sha256:ec0f2062298f09579302685bc2aa83c51020728c935f752aa59402ead9b4dfa0","observation_id":"8cde8375-c848-4407-8c84-54cd5392b112","resolution":{"observed_at":"2026-08-11T00:35:54.412020Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2024.0544","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:35:58.243534Z","title":"Journal of Computational Biology , number =","venue":null,"work_id":"d660a428-9d02-4004-9000-264e93f2d8ca","year":2024},"citing_paper":{"arxiv_id":"2608.07724","last_updated":"2026-08-07T19:28:37Z","snapshot_observed_at":"2026-08-14T21:45:01.249275Z","submitted_at":"2026-08-07T19:28:37Z","title":"Communication-efficient parallel Bruhat decomposition","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-11T00:35:54.416570Z"},"links":{"citing_paper":"/paper/2608.07724"},"observation_digest":"sha256:023b7d3e73fd24c7e8218dd758754621b66f22e089b5bc9b51e721c621ffd89c","observation_id":"14f5c9df-dccc-4420-8bb1-d1db2f8f6b83","resolution":{"observed_at":"2026-08-11T00:35:58.251097Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:35:54.421333Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.07724","last_updated":"2026-08-07T19:28:37Z","snapshot_observed_at":"2026-08-14T21:45:01.249275Z","submitted_at":"2026-08-07T19:28:37Z","title":"Communication-efficient parallel Bruhat decomposition","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-11T00:35:54.421333Z"},"links":{"citing_paper":"/paper/2608.07724"},"observation_digest":"sha256:24add75b13ad3ae1537378c78d0d6574834371810ff8120f37ceca681f63a1c3","observation_id":"96d13e97-5634-4978-b46d-3457dcd36ac2","resolution":{"observed_at":"2026-08-11T00:35:54.421333Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:35:54.425619Z","title":"Trends in Genetics , number =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.07724","last_updated":"2026-08-07T19:28:37Z","snapshot_observed_at":"2026-08-14T21:45:01.249275Z","submitted_at":"2026-08-07T19:28:37Z","title":"Communication-efficient parallel Bruhat decomposition","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-11T00:35:54.425619Z"},"links":{"citing_paper":"/paper/2608.07724"},"observation_digest":"sha256:7770cead2a60fb6c5f712e6b8feedae6aa65c93c94d513adcdc3e3bd5bc769ca","observation_id":"fba84282-a371-4f78-b3ce-38d2768cb4e4","resolution":{"observed_at":"2026-08-11T00:35:54.425619Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:35:54.430059Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.07724","last_updated":"2026-08-07T19:28:37Z","snapshot_observed_at":"2026-08-14T21:45:01.249275Z","submitted_at":"2026-08-07T19:28:37Z","title":"Communication-efficient parallel Bruhat decomposition","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-11T00:35:54.430059Z"},"links":{"citing_paper":"/paper/2608.07724"},"observation_digest":"sha256:ff3f2ea928a5948c8c21eac1943886bf809eb5d80adf4e5b118506d16c8608bd","observation_id":"634da478-846e-4973-8c6e-939d491ab8d8","resolution":{"observed_at":"2026-08-11T00:35:54.430059Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:35:54.434582Z","title":"and Buchanan-Wollaston, Vicky and Tiskin, Alexander and Beynon, Jim and Denby, Katherine and Ott, Sascha , doi =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.07724","last_updated":"2026-08-07T19:28:37Z","snapshot_observed_at":"2026-08-14T21:45:01.249275Z","submitted_at":"2026-08-07T19:28:37Z","title":"Communication-efficient parallel Bruhat decomposition","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-11T00:35:54.434582Z"},"links":{"citing_paper":"/paper/2608.07724"},"observation_digest":"sha256:456286a8e3460c0a227c4ee5bb480ad455045e52ee1f39c95e4a2dbc99b94f8d","observation_id":"ffc1e4d3-c411-4102-a119-e5554af06cda","resolution":{"observed_at":"2026-08-11T00:35:54.434582Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:35:54.438990Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.07724","last_updated":"2026-08-07T19:28:37Z","snapshot_observed_at":"2026-08-14T21:45:01.249275Z","submitted_at":"2026-08-07T19:28:37Z","title":"Communication-efficient parallel Bruhat decomposition","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-11T00:35:54.438990Z"},"links":{"citing_paper":"/paper/2608.07724"},"observation_digest":"sha256:7dad024970043eeccb474c4e6826e8253763fc362b77db79bd4cb5f36ad194cc","observation_id":"9700618a-07db-41b7-8d6d-2d66c2b1dd96","resolution":{"observed_at":"2026-08-11T00:35:54.438990Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:35:54.444852Z","title":"Algorithmica , month =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.07724","last_updated":"2026-08-07T19:28:37Z","snapshot_observed_at":"2026-08-14T21:45:01.249275Z","submitted_at":"2026-08-07T19:28:37Z","title":"Communication-efficient parallel Bruhat decomposition","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-11T00:35:54.444852Z"},"links":{"citing_paper":"/paper/2608.07724"},"observation_digest":"sha256:de348be61560c40d6e1da9bcd06fedffcb5eaf0f2bf983542489fc9d2c4b14ff","observation_id":"d993785b-6ce6-4039-b25d-1ba1eabd63f2","resolution":{"observed_at":"2026-08-11T00:35:54.444852Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:35:54.449450Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.07724","last_updated":"2026-08-07T19:28:37Z","snapshot_observed_at":"2026-08-14T21:45:01.249275Z","submitted_at":"2026-08-07T19:28:37Z","title":"Communication-efficient parallel Bruhat decomposition","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-11T00:35:54.449450Z"},"links":{"citing_paper":"/paper/2608.07724"},"observation_digest":"sha256:5af259edd8d8b90f4360580afdcb6cbee6647c6c4336b61b2e6a52629aa826c2","observation_id":"aadce2da-963b-4a8f-a877-2f351281661d","resolution":{"observed_at":"2026-08-11T00:35:54.449450Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:35:54.453968Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.07724","last_updated":"2026-08-07T19:28:37Z","snapshot_observed_at":"2026-08-14T21:45:01.249275Z","submitted_at":"2026-08-07T19:28:37Z","title":"Communication-efficient parallel Bruhat decomposition","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-11T00:35:54.453968Z"},"links":{"citing_paper":"/paper/2608.07724"},"observation_digest":"sha256:ff5ee4852ea3636c29639db454e1ca92cf6384ab132380da34ac93b00a58e0fb","observation_id":"d8874c8b-3cfd-4a27-a60d-e46d69061506","resolution":{"observed_at":"2026-08-11T00:35:54.453968Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:35:54.458495Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.07724","last_updated":"2026-08-07T19:28:37Z","snapshot_observed_at":"2026-08-14T21:45:01.249275Z","submitted_at":"2026-08-07T19:28:37Z","title":"Communication-efficient parallel Bruhat decomposition","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-11T00:35:54.458495Z"},"links":{"citing_paper":"/paper/2608.07724"},"observation_digest":"sha256:81d474748084bec0f6f27a0e6120bd3319098fb1ff85be6bedfc84b6e0c42427","observation_id":"fd817503-a2da-4f1e-bad7-6791d7e80464","resolution":{"observed_at":"2026-08-11T00:35:54.458495Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:35:54.463062Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.07724","last_updated":"2026-08-07T19:28:37Z","snapshot_observed_at":"2026-08-14T21:45:01.249275Z","submitted_at":"2026-08-07T19:28:37Z","title":"Communication-efficient parallel Bruhat decomposition","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-11T00:35:54.463062Z"},"links":{"citing_paper":"/paper/2608.07724"},"observation_digest":"sha256:46556071eb27c406c2e302b43a0a60d98a518ea372b5c9efe3f3060b653193fd","observation_id":"8cb0f3d1-a976-4b81-a3f5-ad0ce0d68d45","resolution":{"observed_at":"2026-08-11T00:35:54.463062Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:35:54.467409Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.07724","last_updated":"2026-08-07T19:28:37Z","snapshot_observed_at":"2026-08-14T21:45:01.249275Z","submitted_at":"2026-08-07T19:28:37Z","title":"Communication-efficient parallel Bruhat decomposition","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-11T00:35:54.467409Z"},"links":{"citing_paper":"/paper/2608.07724"},"observation_digest":"sha256:32e069dc7ef6eddb08ec3725d284e8a75d3171f59f58b3cf43c00bf67fa6e5e1","observation_id":"3803de83-edb2-45b4-919d-ecf5ca2f19da","resolution":{"observed_at":"2026-08-11T00:35:54.467409Z","resolver_source":null,"status":"parse_uncertain"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/0377-0427(89)90362-2","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:35:56.781418Z","title":"Journal of Computational and Applied Mathematics , number =","venue":null,"work_id":"1f8eb289-db90-4fc3-900f-882539076a64","year":null},"citing_paper":{"arxiv_id":"2608.07724","last_updated":"2026-08-07T19:28:37Z","snapshot_observed_at":"2026-08-14T21:45:01.249275Z","submitted_at":"2026-08-07T19:28:37Z","title":"Communication-efficient parallel Bruhat decomposition","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-11T00:35:54.471831Z"},"links":{"citing_paper":"/paper/2608.07724"},"observation_digest":"sha256:6ae60989383d384c4edeebe9daa09478dbaf25472e21a2912adbe16e46889f16","observation_id":"0a191052-abed-4af2-9df8-d291a787d59c","resolution":{"observed_at":"2026-08-11T00:35:56.786773Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-11T01:08:28.850891+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-11T01:08:28.850891+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2303.03618","last_updated":"2023-03-07T03:05:13Z","snapshot_observed_at":"2026-08-13T12:30:13.623338Z","submitted_at":"2023-03-07T03:05:13Z","title":"Demazure product of permutations and hopping","version":1},"cited_work":{"arxiv_id":"2303.03618","doi":null,"metadata_source":"pith","pith_arxiv_id":"2303.03618","snapshot_observed_at":"2026-08-11T00:35:58.162205Z","title":"Demazure product of permutations and hopping","venue":"math.CO","work_id":"eebc6af0-de96-4538-b050-416eb81b4d46","year":2023},"citing_paper":{"arxiv_id":"2608.07724","last_updated":"2026-08-07T19:28:37Z","snapshot_observed_at":"2026-08-14T21:45:01.249275Z","submitted_at":"2026-08-07T19:28:37Z","title":"Communication-efficient parallel Bruhat decomposition","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-11T00:35:54.476347Z"},"links":{"cited_paper":"/paper/2303.03618","citing_paper":"/paper/2608.07724"},"observation_digest":"sha256:c9d38ee7976941afca761938b4279086036bd71f33255ea5fc0cc9b34659f930","observation_id":"cfb7ce2d-acdc-45cd-8828-48a0a043a60e","resolution":{"observed_at":"2026-08-11T00:35:58.168017Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:35:54.481343Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.07724","last_updated":"2026-08-07T19:28:37Z","snapshot_observed_at":"2026-08-14T21:45:01.249275Z","submitted_at":"2026-08-07T19:28:37Z","title":"Communication-efficient parallel Bruhat decomposition","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-11T00:35:54.481343Z"},"links":{"citing_paper":"/paper/2608.07724"},"observation_digest":"sha256:312915745980dbf63e8b2ff2e2dd2eae5d9e46ff0a29f76270e41782b2dc965c","observation_id":"10d5b192-4ae1-4856-adeb-6afb11830fb4","resolution":{"observed_at":"2026-08-11T00:35:54.481343Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s11227-021-04069-9","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:35:56.766804Z","title":"doi:10.1007/s11227-021-04069-9 , file =","venue":null,"work_id":"e69923c4-77fa-4be4-8756-041e7c4f4b82","year":null},"citing_paper":{"arxiv_id":"2608.07724","last_updated":"2026-08-07T19:28:37Z","snapshot_observed_at":"2026-08-14T21:45:01.249275Z","submitted_at":"2026-08-07T19:28:37Z","title":"Communication-efficient parallel Bruhat decomposition","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-11T00:35:54.485814Z"},"links":{"citing_paper":"/paper/2608.07724"},"observation_digest":"sha256:4f90c1982abe48f2de6a55e7478962ebcd42b97492b37f4651071e60b0c1236f","observation_id":"7565282b-cc7c-42c3-8728-38d85032da43","resolution":{"observed_at":"2026-08-11T00:35:56.771531Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-11T01:08:29.039445+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-11T01:08:29.039445+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:35:54.490554Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.07724","last_updated":"2026-08-07T19:28:37Z","snapshot_observed_at":"2026-08-14T21:45:01.249275Z","submitted_at":"2026-08-07T19:28:37Z","title":"Communication-efficient parallel Bruhat decomposition","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-11T00:35:54.490554Z"},"links":{"citing_paper":"/paper/2608.07724"},"observation_digest":"sha256:7edb35686a5efd5912dbf0e60127c6f01805e3377cc90e432558078b2acbba32","observation_id":"94c88af5-3d8d-4806-aecf-df8902b6491f","resolution":{"observed_at":"2026-08-11T00:35:54.490554Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/11841036_38","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:03:20.376878Z","title":"doi:10.1007/11841036_38 , pages =","venue":"Lecture notes in computer science","work_id":"d2ecec93-7e73-411c-8342-75b0cbcd4ac5","year":null},"citing_paper":{"arxiv_id":"2608.07724","last_updated":"2026-08-07T19:28:37Z","snapshot_observed_at":"2026-08-14T21:45:01.249275Z","submitted_at":"2026-08-07T19:28:37Z","title":"Communication-efficient parallel Bruhat decomposition","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-11T00:35:54.494939Z"},"links":{"citing_paper":"/paper/2608.07724"},"observation_digest":"sha256:3bfcae7ca4d750bb045c00d0ee1c21103e89debcc7fe94b50a8440d918e3e598","observation_id":"d60585dc-f0b9-4e31-999a-648a2542894e","resolution":{"observed_at":"2026-08-11T00:35:56.756615Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-11T01:08:29.234725+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-11T01:08:29.234725+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:35:54.499539Z","title":"ESAIM: Probability and Statistics , month =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.07724","last_updated":"2026-08-07T19:28:37Z","snapshot_observed_at":"2026-08-14T21:45:01.249275Z","submitted_at":"2026-08-07T19:28:37Z","title":"Communication-efficient parallel Bruhat decomposition","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-11T00:35:54.499539Z"},"links":{"citing_paper":"/paper/2608.07724"},"observation_digest":"sha256:61043bea4b31e4a4313b529243c8e81d81beb6088e4cedcd30e1a49a6fe3b470","observation_id":"e2c157d6-aa40-4328-bad9-bbe08d6cfc7a","resolution":{"observed_at":"2026-08-11T00:35:54.499539Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:35:54.504023Z","title":"European Journal of Operational Research , number =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.07724","last_updated":"2026-08-07T19:28:37Z","snapshot_observed_at":"2026-08-14T21:45:01.249275Z","submitted_at":"2026-08-07T19:28:37Z","title":"Communication-efficient parallel Bruhat decomposition","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-11T00:35:54.504023Z"},"links":{"citing_paper":"/paper/2608.07724"},"observation_digest":"sha256:02ef672d0a8dadd5023a7302d9eec314c38189fc008afbedb8ef57f409c10a3f","observation_id":"ec50839a-fd5e-4804-867e-68a340f5f0e3","resolution":{"observed_at":"2026-08-11T00:35:54.504023Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:35:54.508673Z","title":"doi:10.1002/(SICI)1098-2418(199805)12:3<297::AID-RSA5>3.0.CO;2-Q , journal =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.07724","last_updated":"2026-08-07T19:28:37Z","snapshot_observed_at":"2026-08-14T21:45:01.249275Z","submitted_at":"2026-08-07T19:28:37Z","title":"Communication-efficient parallel Bruhat decomposition","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-11T00:35:54.508673Z"},"links":{"citing_paper":"/paper/2608.07724"},"observation_digest":"sha256:c6fb74fb851674eddaf0e4231570dba01736215505458bb9e422e845eb2269cf","observation_id":"0ec111bc-fe9a-490d-bca3-89d7fd0e3311","resolution":{"observed_at":"2026-08-11T00:35:54.508673Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:35:54.513335Z","title":"doi:10.1145/3472456.3472489 , file =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.07724","last_updated":"2026-08-07T19:28:37Z","snapshot_observed_at":"2026-08-14T21:45:01.249275Z","submitted_at":"2026-08-07T19:28:37Z","title":"Communication-efficient parallel Bruhat decomposition","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-11T00:35:54.513335Z"},"links":{"citing_paper":"/paper/2608.07724"},"observation_digest":"sha256:79d8665c9ac9c902f8bb20068ad0ba175550698fed9b66e19424605deb09e2b7","observation_id":"1a6da17e-f66c-4b47-bda5-43afb21cf7c1","resolution":{"observed_at":"2026-08-11T00:35:54.513335Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:35:54.518156Z","title":"Information Processing Letters , number =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.07724","last_updated":"2026-08-07T19:28:37Z","snapshot_observed_at":"2026-08-14T21:45:01.249275Z","submitted_at":"2026-08-07T19:28:37Z","title":"Communication-efficient parallel Bruhat decomposition","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-11T00:35:54.518156Z"},"links":{"citing_paper":"/paper/2608.07724"},"observation_digest":"sha256:815718be2183b5b919c8b852e50ec553a00cab1d17b0330fb2893c33b0f049a8","observation_id":"6bf462e0-cecd-4cb1-b7cb-7824da77dcb2","resolution":{"observed_at":"2026-08-11T00:35:54.518156Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:35:54.522671Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.07724","last_updated":"2026-08-07T19:28:37Z","snapshot_observed_at":"2026-08-14T21:45:01.249275Z","submitted_at":"2026-08-07T19:28:37Z","title":"Communication-efficient parallel Bruhat decomposition","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-11T00:35:54.522671Z"},"links":{"citing_paper":"/paper/2608.07724"},"observation_digest":"sha256:02230686ad5f832625e3f894f5f7aea0ccba9d0f3beab893c6cee1655f800f08","observation_id":"d4e90d50-94d1-4721-877e-2bcd75c4949f","resolution":{"observed_at":"2026-08-11T00:35:54.522671Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:35:54.527268Z","title":"Theoretical Computer Science , pages =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.07724","last_updated":"2026-08-07T19:28:37Z","snapshot_observed_at":"2026-08-14T21:45:01.249275Z","submitted_at":"2026-08-07T19:28:37Z","title":"Communication-efficient parallel Bruhat decomposition","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-11T00:35:54.527268Z"},"links":{"citing_paper":"/paper/2608.07724"},"observation_digest":"sha256:c349810ecdc56c7d3e36d6175e5e212905560315b58ac61e6b4ff4006de027d7","observation_id":"f3bac813-7d34-4462-b5b5-bfd529e5199c","resolution":{"observed_at":"2026-08-11T00:35:54.527268Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:35:54.531834Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.07724","last_updated":"2026-08-07T19:28:37Z","snapshot_observed_at":"2026-08-14T21:45:01.249275Z","submitted_at":"2026-08-07T19:28:37Z","title":"Communication-efficient parallel Bruhat decomposition","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-11T00:35:54.531834Z"},"links":{"citing_paper":"/paper/2608.07724"},"observation_digest":"sha256:bfc2d919dc7dc9bce60a16d5e6299e84e8d576fbf62bf7b026100bac0c52c6d0","observation_id":"a9ba3b98-6853-4098-8d4a-f1b1dfc8030f","resolution":{"observed_at":"2026-08-11T00:35:54.531834Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:35:54.536405Z","title":"Program Systems: Theory and Applications , number =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.07724","last_updated":"2026-08-07T19:28:37Z","snapshot_observed_at":"2026-08-14T21:45:01.249275Z","submitted_at":"2026-08-07T19:28:37Z","title":"Communication-efficient parallel Bruhat decomposition","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-11T00:35:54.536405Z"},"links":{"citing_paper":"/paper/2608.07724"},"observation_digest":"sha256:246522eba5e185476c4c5d3d5f5521ed184a51379a02b486af1b03bb93750036","observation_id":"1edb981c-9024-4fc5-8c5a-33d841e3228f","resolution":{"observed_at":"2026-08-11T00:35:54.536405Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-540-69068-9_15","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-13T11:03:48.094449Z","title":"doi:10.1007/978-3-540-69068-9_15 , pages =","venue":"Lecture notes in computer science","work_id":"a42009f8-1f71-42ae-ba15-70d6d5f3493c","year":null},"citing_paper":{"arxiv_id":"2608.07724","last_updated":"2026-08-07T19:28:37Z","snapshot_observed_at":"2026-08-14T21:45:01.249275Z","submitted_at":"2026-08-07T19:28:37Z","title":"Communication-efficient parallel Bruhat decomposition","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-11T00:35:54.540980Z"},"links":{"citing_paper":"/paper/2608.07724"},"observation_digest":"sha256:1a5a1e1a8f353017c8a76b3ee2dc58364ffbf8c0cb4a7f02554b54988c67cc5d","observation_id":"ebb2cb9a-2bfd-40de-98d8-3ac5ce2f571d","resolution":{"observed_at":"2026-08-11T00:35:56.732215Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-11T01:08:29.571114+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-11T01:08:29.571114+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:35:54.545438Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.07724","last_updated":"2026-08-07T19:28:37Z","snapshot_observed_at":"2026-08-14T21:45:01.249275Z","submitted_at":"2026-08-07T19:28:37Z","title":"Communication-efficient parallel Bruhat decomposition","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-11T00:35:54.545438Z"},"links":{"citing_paper":"/paper/2608.07724"},"observation_digest":"sha256:d7c527323c5be46781246d1e10c4515600258651795ab6537f1a90af5586da99","observation_id":"3b43a416-5201-465f-8b7e-8196175979a5","resolution":{"observed_at":"2026-08-11T00:35:54.545438Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/0020-0190(79)90023-1","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:35:56.711912Z","title":"doi:10.1016/0020-0190(79)90023-1 , journal =","venue":null,"work_id":"85c68dcd-f38f-41a4-8716-a32adb6900d9","year":null},"citing_paper":{"arxiv_id":"2608.07724","last_updated":"2026-08-07T19:28:37Z","snapshot_observed_at":"2026-08-14T21:45:01.249275Z","submitted_at":"2026-08-07T19:28:37Z","title":"Communication-efficient parallel Bruhat decomposition","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-11T00:35:54.549818Z"},"links":{"citing_paper":"/paper/2608.07724"},"observation_digest":"sha256:37ff4daa8b3981be64219284c9120ffc35fd4e3504421f24a1bdf443f680a825","observation_id":"66e9aaad-ce29-4b49-8f6c-8ebf2ac763ed","resolution":{"observed_at":"2026-08-11T00:35:56.716637Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-11T01:08:29.84247+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-11T01:08:29.84247+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:35:54.554767Z","title":"Bulletin of the AMS , pages =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.07724","last_updated":"2026-08-07T19:28:37Z","snapshot_observed_at":"2026-08-14T21:45:01.249275Z","submitted_at":"2026-08-07T19:28:37Z","title":"Communication-efficient parallel Bruhat decomposition","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-11T00:35:54.554767Z"},"links":{"citing_paper":"/paper/2608.07724"},"observation_digest":"sha256:fc9df15aaf6cfdf6fa2aed8321a25ca5b80d21e7fd8da091542be1ec500fed45","observation_id":"5c0939ab-c950-4e01-ae34-78e461710272","resolution":{"observed_at":"2026-08-11T00:35:54.554767Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:35:54.559105Z","title":"ACM Transactions on Algorithms , number =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.07724","last_updated":"2026-08-07T19:28:37Z","snapshot_observed_at":"2026-08-14T21:45:01.249275Z","submitted_at":"2026-08-07T19:28:37Z","title":"Communication-efficient parallel Bruhat decomposition","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-11T00:35:54.559105Z"},"links":{"citing_paper":"/paper/2608.07724"},"observation_digest":"sha256:1fc0ad269a8eca18351e07b53b6464f3719a11a8cf5bebc30cde81893be2d414","observation_id":"7ccbc76f-72a9-4458-99f7-265324344150","resolution":{"observed_at":"2026-08-11T00:35:54.559105Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:35:54.563682Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.07724","last_updated":"2026-08-07T19:28:37Z","snapshot_observed_at":"2026-08-14T21:45:01.249275Z","submitted_at":"2026-08-07T19:28:37Z","title":"Communication-efficient parallel Bruhat decomposition","version":1},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-11T00:35:54.563682Z"},"links":{"citing_paper":"/paper/2608.07724"},"observation_digest":"sha256:5d13f08673b3e916fc6ce4b7ce1377ce5ad493501b7dbaf58a38a2348536e211","observation_id":"defdef3a-ea6d-4142-9a39-5c61ead1e975","resolution":{"observed_at":"2026-08-11T00:35:54.563682Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/3-540-44968-x_27","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:03:20.376878Z","title":"doi:10.1007/3-540-44968-X_27 , pages =","venue":"Lecture notes in computer science","work_id":"38a385e8-db85-4e3f-bcb3-65dfb2f3fe16","year":null},"citing_paper":{"arxiv_id":"2608.07724","last_updated":"2026-08-07T19:28:37Z","snapshot_observed_at":"2026-08-14T21:45:01.249275Z","submitted_at":"2026-08-07T19:28:37Z","title":"Communication-efficient parallel Bruhat decomposition","version":1},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-08-11T00:35:54.568113Z"},"links":{"citing_paper":"/paper/2608.07724"},"observation_digest":"sha256:4b1171bd8d6a99ef548d777abf8840322a9beed9ea31d9d519672ce1d806a30d","observation_id":"1820fb67-a651-4527-b25f-bd82dc649d33","resolution":{"observed_at":"2026-08-11T00:35:56.700796Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-11T01:08:29.995261+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-11T01:08:29.995261+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:35:54.572590Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.07724","last_updated":"2026-08-07T19:28:37Z","snapshot_observed_at":"2026-08-14T21:45:01.249275Z","submitted_at":"2026-08-07T19:28:37Z","title":"Communication-efficient parallel Bruhat decomposition","version":1},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-08-11T00:35:54.572590Z"},"links":{"citing_paper":"/paper/2608.07724"},"observation_digest":"sha256:d3a6822722a76d5f413c3d81a8c513d21dc9a28882eb11d5a0c8b0c944f786f6","observation_id":"6a79e732-d443-4eba-9e7c-8c9e3fb0f443","resolution":{"observed_at":"2026-08-11T00:35:54.572590Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2208.08915","last_updated":"2025-06-12T14:06:58Z","snapshot_observed_at":"2026-08-13T14:43:13.642261Z","submitted_at":"2022-08-18T15:35:06Z","title":"Approximate Circular Pattern Matching","version":2},"cited_work":{"arxiv_id":"2208.08915","doi":null,"metadata_source":"pith","pith_arxiv_id":"2208.08915","snapshot_observed_at":"2026-08-11T00:35:57.987259Z","title":"Approximate Circular Pattern Matching","venue":"cs.DS","work_id":"baf379ed-0997-4578-88f4-24c89140bb89","year":2022},"citing_paper":{"arxiv_id":"2608.07724","last_updated":"2026-08-07T19:28:37Z","snapshot_observed_at":"2026-08-14T21:45:01.249275Z","submitted_at":"2026-08-07T19:28:37Z","title":"Communication-efficient parallel Bruhat decomposition","version":1},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-08-11T00:35:54.577003Z"},"links":{"cited_paper":"/paper/2208.08915","citing_paper":"/paper/2608.07724"},"observation_digest":"sha256:67b447cdcfcaa8bcad0cf85dc18a2c9b93655e9e2809203eec2dc1822adb3208","observation_id":"d9c2881f-ddc4-4859-a423-0c2388f980a7","resolution":{"observed_at":"2026-08-11T00:35:57.992538Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-642-59448-9_15","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-13T11:03:48.094449Z","title":"doi:10.1007/978-3-642-59448-9_15 , file =","venue":null,"work_id":"acc535cf-4e38-4a65-8e27-f2b439989273","year":null},"citing_paper":{"arxiv_id":"2608.07724","last_updated":"2026-08-07T19:28:37Z","snapshot_observed_at":"2026-08-14T21:45:01.249275Z","submitted_at":"2026-08-07T19:28:37Z","title":"Communication-efficient parallel Bruhat decomposition","version":1},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-08-11T00:35:54.581930Z"},"links":{"citing_paper":"/paper/2608.07724"},"observation_digest":"sha256:3a9a4617b77af7a68de6bbe3cbfeb1aa37263930413648d4579e7651b6c7989a","observation_id":"0ceed26c-87f8-4817-9ddf-328e5ec99029","resolution":{"observed_at":"2026-08-11T00:35:56.685665Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-11T01:08:30.161102+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-11T01:08:30.161102+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:35:54.587411Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.07724","last_updated":"2026-08-07T19:28:37Z","snapshot_observed_at":"2026-08-14T21:45:01.249275Z","submitted_at":"2026-08-07T19:28:37Z","title":"Communication-efficient parallel Bruhat decomposition","version":1},"reference_index":61,"source":"arxiv_source","source_observed_at":"2026-08-11T00:35:54.587411Z"},"links":{"citing_paper":"/paper/2608.07724"},"observation_digest":"sha256:072af0e3674f81990161e4925f096b7ff8b15f72a60147176c4a121069d06781","observation_id":"e0691e82-0e4d-451c-83bb-304b4e2e9828","resolution":{"observed_at":"2026-08-11T00:35:54.587411Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:35:54.592231Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.07724","last_updated":"2026-08-07T19:28:37Z","snapshot_observed_at":"2026-08-14T21:45:01.249275Z","submitted_at":"2026-08-07T19:28:37Z","title":"Communication-efficient parallel Bruhat decomposition","version":1},"reference_index":62,"source":"arxiv_source","source_observed_at":"2026-08-11T00:35:54.592231Z"},"links":{"citing_paper":"/paper/2608.07724"},"observation_digest":"sha256:346424eb67a32dbe33bf762fbda4f84da6204bb3fd2661de155f454ad78a99ac","observation_id":"d1916938-3a43-4712-927c-6ac5d2ebbde3","resolution":{"observed_at":"2026-08-11T00:35:54.592231Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:35:54.596857Z","title":"Journal of Algorithms , number =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.07724","last_updated":"2026-08-07T19:28:37Z","snapshot_observed_at":"2026-08-14T21:45:01.249275Z","submitted_at":"2026-08-07T19:28:37Z","title":"Communication-efficient parallel Bruhat decomposition","version":1},"reference_index":63,"source":"arxiv_source","source_observed_at":"2026-08-11T00:35:54.596857Z"},"links":{"citing_paper":"/paper/2608.07724"},"observation_digest":"sha256:ac70061b591e163ab76ec037d5fc2319773cc53fd5e2ac032494335923cc5f14","observation_id":"a5be70d0-4c41-4886-8c6d-119ea572285f","resolution":{"observed_at":"2026-08-11T00:35:54.596857Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:35:54.601360Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.07724","last_updated":"2026-08-07T19:28:37Z","snapshot_observed_at":"2026-08-14T21:45:01.249275Z","submitted_at":"2026-08-07T19:28:37Z","title":"Communication-efficient parallel Bruhat decomposition","version":1},"reference_index":64,"source":"arxiv_source","source_observed_at":"2026-08-11T00:35:54.601360Z"},"links":{"citing_paper":"/paper/2608.07724"},"observation_digest":"sha256:c147f4ad303119118b3ef0f643fff41db8487bdd635e275ca3134af6ce1c3316","observation_id":"9e91fb3d-cc74-4667-acf2-325c576540a9","resolution":{"observed_at":"2026-08-11T00:35:54.601360Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:35:54.606115Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.07724","last_updated":"2026-08-07T19:28:37Z","snapshot_observed_at":"2026-08-14T21:45:01.249275Z","submitted_at":"2026-08-07T19:28:37Z","title":"Communication-efficient parallel Bruhat decomposition","version":1},"reference_index":65,"source":"arxiv_source","source_observed_at":"2026-08-11T00:35:54.606115Z"},"links":{"citing_paper":"/paper/2608.07724"},"observation_digest":"sha256:7c1f866923100beb3093de293784b6e230a701d8985d9fba3208261d53055d4f","observation_id":"fa29b927-7013-469a-874d-d52b526b347d","resolution":{"observed_at":"2026-08-11T00:35:54.606115Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:35:54.610779Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.07724","last_updated":"2026-08-07T19:28:37Z","snapshot_observed_at":"2026-08-14T21:45:01.249275Z","submitted_at":"2026-08-07T19:28:37Z","title":"Communication-efficient parallel Bruhat decomposition","version":1},"reference_index":66,"source":"arxiv_source","source_observed_at":"2026-08-11T00:35:54.610779Z"},"links":{"citing_paper":"/paper/2608.07724"},"observation_digest":"sha256:f016d6a8df651fecf316a4f790ae319d2385e097c5d565e6401857cd13a88402","observation_id":"ff5a97a1-60fb-4801-9e65-20ff7cacfd1c","resolution":{"observed_at":"2026-08-11T00:35:54.610779Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:35:54.615455Z","title":", file =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.07724","last_updated":"2026-08-07T19:28:37Z","snapshot_observed_at":"2026-08-14T21:45:01.249275Z","submitted_at":"2026-08-07T19:28:37Z","title":"Communication-efficient parallel Bruhat decomposition","version":1},"reference_index":67,"source":"arxiv_source","source_observed_at":"2026-08-11T00:35:54.615455Z"},"links":{"citing_paper":"/paper/2608.07724"},"observation_digest":"sha256:af62f9fb46ebcc0ef549ac0a4fcf9e3699e322313374824ebf05e08548244150","observation_id":"02a04e72-6486-4f51-a281-7cef880c746f","resolution":{"observed_at":"2026-08-11T00:35:54.615455Z","resolver_source":null,"status":"parse_uncertain"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1088/1742-5468/2010/04/p04022","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:35:56.664913Z","title":"Journal of Statistical Mechanics: Theory and Experiment , number =","venue":null,"work_id":"89699457-0e0a-4d75-ad2b-dbfa9b1faadc","year":2010},"citing_paper":{"arxiv_id":"2608.07724","last_updated":"2026-08-07T19:28:37Z","snapshot_observed_at":"2026-08-14T21:45:01.249275Z","submitted_at":"2026-08-07T19:28:37Z","title":"Communication-efficient parallel Bruhat decomposition","version":1},"reference_index":68,"source":"arxiv_source","source_observed_at":"2026-08-11T00:35:54.620137Z"},"links":{"citing_paper":"/paper/2608.07724"},"observation_digest":"sha256:5a73d7f1946d1cf150af91697cd5d338fe046648ab9ca78e3ec77de37321ca7d","observation_id":"d98480e0-aee4-4fc2-a1c9-5f46d149bcc5","resolution":{"observed_at":"2026-08-11T00:35:56.669732Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-11T01:08:30.367454+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-11T01:08:30.367454+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-642-34109-0-24","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:35:56.649937Z","title":", booktitle =","venue":null,"work_id":"0d796766-fc62-4db4-9fbf-65f6291fc5cd","year":null},"citing_paper":{"arxiv_id":"2608.07724","last_updated":"2026-08-07T19:28:37Z","snapshot_observed_at":"2026-08-14T21:45:01.249275Z","submitted_at":"2026-08-07T19:28:37Z","title":"Communication-efficient parallel Bruhat decomposition","version":1},"reference_index":69,"source":"arxiv_source","source_observed_at":"2026-08-11T00:35:54.625525Z"},"links":{"citing_paper":"/paper/2608.07724"},"observation_digest":"sha256:99a619ebb1784eb797cbd9d0b4c5cb55f8e41191157a7dbb492ce4372dee4ae5","observation_id":"e029068a-758f-44fb-b52b-78fc7b3674a2","resolution":{"observed_at":"2026-08-11T00:35:56.654560Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-11T01:08:30.524635+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-11T01:08:30.524635+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/s0166-218x(02)00418-3","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:35:56.635153Z","title":"doi:10.1016/S0166-218X(02)00418-3 , issn =","venue":null,"work_id":"be419d0d-2a56-418e-a684-827a0eee62e4","year":null},"citing_paper":{"arxiv_id":"2608.07724","last_updated":"2026-08-07T19:28:37Z","snapshot_observed_at":"2026-08-14T21:45:01.249275Z","submitted_at":"2026-08-07T19:28:37Z","title":"Communication-efficient parallel Bruhat decomposition","version":1},"reference_index":70,"source":"arxiv_source","source_observed_at":"2026-08-11T00:35:54.630492Z"},"links":{"citing_paper":"/paper/2608.07724"},"observation_digest":"sha256:518d1bfaaae94b6727e1c75f729a2d1a10bb8e05cb0b696b14ac301a4d3902b8","observation_id":"139109e6-3440-489a-8cd5-82458aae2b8e","resolution":{"observed_at":"2026-08-11T00:35:56.639753Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-11T01:08:30.723708+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-11T01:08:30.723708+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:35:54.635163Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.07724","last_updated":"2026-08-07T19:28:37Z","snapshot_observed_at":"2026-08-14T21:45:01.249275Z","submitted_at":"2026-08-07T19:28:37Z","title":"Communication-efficient parallel Bruhat decomposition","version":1},"reference_index":71,"source":"arxiv_source","source_observed_at":"2026-08-11T00:35:54.635163Z"},"links":{"citing_paper":"/paper/2608.07724"},"observation_digest":"sha256:84b12bf560e3d55c65fbcb8b63e724a3fbb44e9a29950f973713ae9331d30a4c","observation_id":"a552cd7f-76dc-4774-8dcb-9e818786de6a","resolution":{"observed_at":"2026-08-11T00:35:54.635163Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:35:54.639572Z","title":"Information Processing Letters , number =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.07724","last_updated":"2026-08-07T19:28:37Z","snapshot_observed_at":"2026-08-14T21:45:01.249275Z","submitted_at":"2026-08-07T19:28:37Z","title":"Communication-efficient parallel Bruhat decomposition","version":1},"reference_index":72,"source":"arxiv_source","source_observed_at":"2026-08-11T00:35:54.639572Z"},"links":{"citing_paper":"/paper/2608.07724"},"observation_digest":"sha256:2f28dfa7aac47359ed1cb607cd0d5a29f0569dc206ada934c047f394b21c6e9e","observation_id":"dfedab26-eaf6-4266-928d-d9007d2b0150","resolution":{"observed_at":"2026-08-11T00:35:54.639572Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:35:54.644137Z","title":"doi:10.1109/IPDPS.2019.00058 , file =","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2608.07724","last_updated":"2026-08-07T19:28:37Z","snapshot_observed_at":"2026-08-14T21:45:01.249275Z","submitted_at":"2026-08-07T19:28:37Z","title":"Communication-efficient parallel Bruhat decomposition","version":1},"reference_index":73,"source":"arxiv_source","source_observed_at":"2026-08-11T00:35:54.644137Z"},"links":{"citing_paper":"/paper/2608.07724"},"observation_digest":"sha256:c7fae6f2b414ec67a2913bdecad28e5a679f7c2100fea6a98612421cc6412a27","observation_id":"a29a4792-47c5-40bc-9142-7de9655852f0","resolution":{"observed_at":"2026-08-11T00:35:54.644137Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:35:54.649062Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.07724","last_updated":"2026-08-07T19:28:37Z","snapshot_observed_at":"2026-08-14T21:45:01.249275Z","submitted_at":"2026-08-07T19:28:37Z","title":"Communication-efficient parallel Bruhat decomposition","version":1},"reference_index":74,"source":"arxiv_source","source_observed_at":"2026-08-11T00:35:54.649062Z"},"links":{"citing_paper":"/paper/2608.07724"},"observation_digest":"sha256:1d26f3c9ebe58dfabd387d2de29478fa6769790674059862b2713c5758a0c517","observation_id":"cc03590a-f420-43d6-b336-d995a4df07d6","resolution":{"observed_at":"2026-08-11T00:35:54.649062Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:35:54.653784Z","title":"Information Processing Letters , month =","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2608.07724","last_updated":"2026-08-07T19:28:37Z","snapshot_observed_at":"2026-08-14T21:45:01.249275Z","submitted_at":"2026-08-07T19:28:37Z","title":"Communication-efficient parallel Bruhat decomposition","version":1},"reference_index":75,"source":"arxiv_source","source_observed_at":"2026-08-11T00:35:54.653784Z"},"links":{"citing_paper":"/paper/2608.07724"},"observation_digest":"sha256:2bb69fe80ce33790e3fc9fa2028518d0bfedac01531f79e9b1a1945422502108","observation_id":"f8453d8c-eed9-4617-9de5-8e60dc3ed595","resolution":{"observed_at":"2026-08-11T00:35:54.653784Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:35:54.658652Z","title":"The Mathematical Intelligencer , number =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.07724","last_updated":"2026-08-07T19:28:37Z","snapshot_observed_at":"2026-08-14T21:45:01.249275Z","submitted_at":"2026-08-07T19:28:37Z","title":"Communication-efficient parallel Bruhat decomposition","version":1},"reference_index":76,"source":"arxiv_source","source_observed_at":"2026-08-11T00:35:54.658652Z"},"links":{"citing_paper":"/paper/2608.07724"},"observation_digest":"sha256:73c982071ca4d53f1f5e86a6e11caf3ecaa2ddcfc384c9b4d8bf9e38009ff5a9","observation_id":"4f6a7ed5-5d30-4bcf-9bc7-1f116dddbfe8","resolution":{"observed_at":"2026-08-11T00:35:54.658652Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:35:54.663323Z","title":"SIAM Journal of Computing , pages =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.07724","last_updated":"2026-08-07T19:28:37Z","snapshot_observed_at":"2026-08-14T21:45:01.249275Z","submitted_at":"2026-08-07T19:28:37Z","title":"Communication-efficient parallel Bruhat decomposition","version":1},"reference_index":77,"source":"arxiv_source","source_observed_at":"2026-08-11T00:35:54.663323Z"},"links":{"citing_paper":"/paper/2608.07724"},"observation_digest":"sha256:27bac8d3f8f160658cf1b2990d3228235c888b2876cc4c2b3895e1e4cb8bb139","observation_id":"c4d0e7f3-e26f-41fe-a740-2f763c3cd89e","resolution":{"observed_at":"2026-08-11T00:35:54.663323Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:35:54.668132Z","title":"Proceedings of WG , doi =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.07724","last_updated":"2026-08-07T19:28:37Z","snapshot_observed_at":"2026-08-14T21:45:01.249275Z","submitted_at":"2026-08-07T19:28:37Z","title":"Communication-efficient parallel Bruhat decomposition","version":1},"reference_index":78,"source":"arxiv_source","source_observed_at":"2026-08-11T00:35:54.668132Z"},"links":{"citing_paper":"/paper/2608.07724"},"observation_digest":"sha256:99886e5d66f8eab3bf6ffa22d1ca53181357fb768ff15e9405e559cb8c66d403","observation_id":"10558923-3278-443d-bf4e-d8632da13a60","resolution":{"observed_at":"2026-08-11T00:35:54.668132Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:35:54.672750Z","title":"Algorithmica , keywords =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.07724","last_updated":"2026-08-07T19:28:37Z","snapshot_observed_at":"2026-08-14T21:45:01.249275Z","submitted_at":"2026-08-07T19:28:37Z","title":"Communication-efficient parallel Bruhat decomposition","version":1},"reference_index":79,"source":"arxiv_source","source_observed_at":"2026-08-11T00:35:54.672750Z"},"links":{"citing_paper":"/paper/2608.07724"},"observation_digest":"sha256:e444f8cf6320a824fb5140af3aad9a3b0394bc2df0aafb0bb3e33efae580feea","observation_id":"6994fce2-4775-4e57-aede-9c9915a031c5","resolution":{"observed_at":"2026-08-11T00:35:54.672750Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s00454-018-0012-2","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:35:56.610747Z","title":"doi:10.1007/s00454-018-0012-2 , file =","venue":null,"work_id":"41d02957-bcf6-4fd0-98bd-fea5f330eda3","year":null},"citing_paper":{"arxiv_id":"2608.07724","last_updated":"2026-08-07T19:28:37Z","snapshot_observed_at":"2026-08-14T21:45:01.249275Z","submitted_at":"2026-08-07T19:28:37Z","title":"Communication-efficient parallel Bruhat decomposition","version":1},"reference_index":80,"source":"arxiv_source","source_observed_at":"2026-08-11T00:35:54.677222Z"},"links":{"citing_paper":"/paper/2608.07724"},"observation_digest":"sha256:d38163ff047055bd314794f3669e95cc6803aee722952a4ba238c962f8b2b9b6","observation_id":"e2db352f-c84d-47ff-9b2b-8fd008c88703","resolution":{"observed_at":"2026-08-11T00:35:56.615723Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-11T01:08:31.090082+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-11T01:08:31.090082+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:35:54.682234Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.07724","last_updated":"2026-08-07T19:28:37Z","snapshot_observed_at":"2026-08-14T21:45:01.249275Z","submitted_at":"2026-08-07T19:28:37Z","title":"Communication-efficient parallel Bruhat decomposition","version":1},"reference_index":81,"source":"arxiv_source","source_observed_at":"2026-08-11T00:35:54.682234Z"},"links":{"citing_paper":"/paper/2608.07724"},"observation_digest":"sha256:b2b530afc4afcabff3f1ee46f9e1700d3a0ec9103bd0b17bbd8506cb6ed695a4","observation_id":"29298fa1-7930-456a-9221-1ea50484fed8","resolution":{"observed_at":"2026-08-11T00:35:54.682234Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:35:54.686808Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.07724","last_updated":"2026-08-07T19:28:37Z","snapshot_observed_at":"2026-08-14T21:45:01.249275Z","submitted_at":"2026-08-07T19:28:37Z","title":"Communication-efficient parallel Bruhat decomposition","version":1},"reference_index":82,"source":"arxiv_source","source_observed_at":"2026-08-11T00:35:54.686808Z"},"links":{"citing_paper":"/paper/2608.07724"},"observation_digest":"sha256:8a3fc353d072e21bb44880bd39831c1647b860f0f4721575d57c1cdc69a8dbe2","observation_id":"62c38daf-3e08-4588-ad91-50a22ee509f6","resolution":{"observed_at":"2026-08-11T00:35:54.686808Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:35:54.691502Z","title":"Proceedings of ICALP , doi =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.07724","last_updated":"2026-08-07T19:28:37Z","snapshot_observed_at":"2026-08-14T21:45:01.249275Z","submitted_at":"2026-08-07T19:28:37Z","title":"Communication-efficient parallel Bruhat decomposition","version":1},"reference_index":83,"source":"arxiv_source","source_observed_at":"2026-08-11T00:35:54.691502Z"},"links":{"citing_paper":"/paper/2608.07724"},"observation_digest":"sha256:4b08651a45e7eac211c48a1f43cb65fc9894198d379b6273f5d1b00e5e5d0969","observation_id":"c29e0e46-891d-4d1e-8a27-ca06de7423bc","resolution":{"observed_at":"2026-08-11T00:35:54.691502Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:35:54.696120Z","title":"doi:10.4230/LIPIcs.CPM.2023.3 , file =","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.07724","last_updated":"2026-08-07T19:28:37Z","snapshot_observed_at":"2026-08-14T21:45:01.249275Z","submitted_at":"2026-08-07T19:28:37Z","title":"Communication-efficient parallel Bruhat decomposition","version":1},"reference_index":84,"source":"arxiv_source","source_observed_at":"2026-08-11T00:35:54.696120Z"},"links":{"citing_paper":"/paper/2608.07724"},"observation_digest":"sha256:b9f98ba7cee6d5825a400636b9fbb85b2091b4e24f0d168b2e09651c75233ca4","observation_id":"2b1188f6-8988-45a3-bbdf-3fc478fee0fe","resolution":{"observed_at":"2026-08-11T00:35:54.696120Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:35:54.700979Z","title":"Information Processing Letters , pages =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.07724","last_updated":"2026-08-07T19:28:37Z","snapshot_observed_at":"2026-08-14T21:45:01.249275Z","submitted_at":"2026-08-07T19:28:37Z","title":"Communication-efficient parallel Bruhat decomposition","version":1},"reference_index":85,"source":"arxiv_source","source_observed_at":"2026-08-11T00:35:54.700979Z"},"links":{"citing_paper":"/paper/2608.07724"},"observation_digest":"sha256:db8012b1031c6cc485927b480f906a8964a7f15c6930e0833337609135b21438","observation_id":"e9498731-dc99-4058-8f3a-c955e9bb3597","resolution":{"observed_at":"2026-08-11T00:35:54.700979Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:35:54.706056Z","title":"Journal of Algebra , month =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.07724","last_updated":"2026-08-07T19:28:37Z","snapshot_observed_at":"2026-08-14T21:45:01.249275Z","submitted_at":"2026-08-07T19:28:37Z","title":"Communication-efficient parallel Bruhat decomposition","version":1},"reference_index":86,"source":"arxiv_source","source_observed_at":"2026-08-11T00:35:54.706056Z"},"links":{"citing_paper":"/paper/2608.07724"},"observation_digest":"sha256:c35dc1ef7e0cfc2d6c1f78ba44ac46fdc76b14d0d50b8677e207703bba5b0a0e","observation_id":"a89db09e-cef0-4168-9024-80df89a81789","resolution":{"observed_at":"2026-08-11T00:35:54.706056Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:35:54.710679Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.07724","last_updated":"2026-08-07T19:28:37Z","snapshot_observed_at":"2026-08-14T21:45:01.249275Z","submitted_at":"2026-08-07T19:28:37Z","title":"Communication-efficient parallel Bruhat decomposition","version":1},"reference_index":87,"source":"arxiv_source","source_observed_at":"2026-08-11T00:35:54.710679Z"},"links":{"citing_paper":"/paper/2608.07724"},"observation_digest":"sha256:402c3a5860ac2e75eabec6b3d2d336d1ee3dd356dec65e2518f7108b88bf15c5","observation_id":"49081448-a4ac-4671-8c9f-31434d8936a6","resolution":{"observed_at":"2026-08-11T00:35:54.710679Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:35:54.715023Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.07724","last_updated":"2026-08-07T19:28:37Z","snapshot_observed_at":"2026-08-14T21:45:01.249275Z","submitted_at":"2026-08-07T19:28:37Z","title":"Communication-efficient parallel Bruhat decomposition","version":1},"reference_index":88,"source":"arxiv_source","source_observed_at":"2026-08-11T00:35:54.715023Z"},"links":{"citing_paper":"/paper/2608.07724"},"observation_digest":"sha256:d2fb87373caecab190b40eb1b68db7894329d9eb89c46349f3b2ab1c1bf71404","observation_id":"2566f475-4b32-4c98-ba5d-8a0c8bf99e86","resolution":{"observed_at":"2026-08-11T00:35:54.715023Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:35:54.719387Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.07724","last_updated":"2026-08-07T19:28:37Z","snapshot_observed_at":"2026-08-14T21:45:01.249275Z","submitted_at":"2026-08-07T19:28:37Z","title":"Communication-efficient parallel Bruhat decomposition","version":1},"reference_index":89,"source":"arxiv_source","source_observed_at":"2026-08-11T00:35:54.719387Z"},"links":{"citing_paper":"/paper/2608.07724"},"observation_digest":"sha256:5fc5a7a552cdb5b96bcf8de41769a23306a43aa403f042a3a83b41f4342ce8ed","observation_id":"24577179-3afc-4a5f-ab31-ccc8396b240a","resolution":{"observed_at":"2026-08-11T00:35:54.719387Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/bfb0024720","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:08:50.044864Z","title":"doi:10.1007/BFb0024720 , pages =","venue":"Lecture notes in computer science","work_id":"0447edab-bb91-4278-968d-f1a4a5fce3a8","year":null},"citing_paper":{"arxiv_id":"2608.07724","last_updated":"2026-08-07T19:28:37Z","snapshot_observed_at":"2026-08-14T21:45:01.249275Z","submitted_at":"2026-08-07T19:28:37Z","title":"Communication-efficient parallel Bruhat decomposition","version":1},"reference_index":90,"source":"arxiv_source","source_observed_at":"2026-08-11T00:35:54.723585Z"},"links":{"citing_paper":"/paper/2608.07724"},"observation_digest":"sha256:0c8ad27fe24f57c0f19b8d0d5e785fa797422d38c738fb628b3d3f11fd9482a5","observation_id":"13f9a6c9-a486-4ec3-baca-0ad0b2f7f252","resolution":{"observed_at":"2026-08-11T00:35:56.589539Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-11T01:08:31.443601+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-11T01:08:31.443601+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:35:54.727951Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.07724","last_updated":"2026-08-07T19:28:37Z","snapshot_observed_at":"2026-08-14T21:45:01.249275Z","submitted_at":"2026-08-07T19:28:37Z","title":"Communication-efficient parallel Bruhat decomposition","version":1},"reference_index":91,"source":"arxiv_source","source_observed_at":"2026-08-11T00:35:54.727951Z"},"links":{"citing_paper":"/paper/2608.07724"},"observation_digest":"sha256:24b0e1c15cb203b99c8be276966168c4c84d38c0795b3b1df4a6189e79404166","observation_id":"3fa1bed1-37f8-4233-b88a-cfad228e0bc6","resolution":{"observed_at":"2026-08-11T00:35:54.727951Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:35:54.732677Z","title":"Theoretical Computer Science , month =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.07724","last_updated":"2026-08-07T19:28:37Z","snapshot_observed_at":"2026-08-14T21:45:01.249275Z","submitted_at":"2026-08-07T19:28:37Z","title":"Communication-efficient parallel Bruhat decomposition","version":1},"reference_index":92,"source":"arxiv_source","source_observed_at":"2026-08-11T00:35:54.732677Z"},"links":{"citing_paper":"/paper/2608.07724"},"observation_digest":"sha256:e0bdcfb8978fc53978820ce4f7735dbdf48ca04f10403e25b45e2946003abab3","observation_id":"3805a77b-2ddf-47d8-a128-148eb65fe654","resolution":{"observed_at":"2026-08-11T00:35:54.732677Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:35:54.737376Z","title":"Journal of the ACM , number =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.07724","last_updated":"2026-08-07T19:28:37Z","snapshot_observed_at":"2026-08-14T21:45:01.249275Z","submitted_at":"2026-08-07T19:28:37Z","title":"Communication-efficient parallel Bruhat decomposition","version":1},"reference_index":93,"source":"arxiv_source","source_observed_at":"2026-08-11T00:35:54.737376Z"},"links":{"citing_paper":"/paper/2608.07724"},"observation_digest":"sha256:bdfa4fdc78c9029708f97925e9c5b19e0e2cc237d3ed1d83f744198b901dc2b9","observation_id":"0edc4426-855d-40f4-86eb-1cc3e297a33b","resolution":{"observed_at":"2026-08-11T00:35:54.737376Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2302.04475","last_updated":"2023-11-27T15:47:05Z","snapshot_observed_at":"2026-08-13T12:48:18.138195Z","submitted_at":"2023-02-09T07:37:45Z","title":"Locally consistent decomposition of strings with applications to edit distance sketching","version":2},"cited_work":{"arxiv_id":"2302.04475","doi":null,"metadata_source":"pith","pith_arxiv_id":"2302.04475","snapshot_observed_at":"2026-08-11T00:35:57.888550Z","title":"Locally consistent decomposition of strings with applications to edit distance sketching","venue":"cs.DS","work_id":"213e260c-99bd-4f70-9ccd-21008e8c3759","year":2023},"citing_paper":{"arxiv_id":"2608.07724","last_updated":"2026-08-07T19:28:37Z","snapshot_observed_at":"2026-08-14T21:45:01.249275Z","submitted_at":"2026-08-07T19:28:37Z","title":"Communication-efficient parallel Bruhat decomposition","version":1},"reference_index":94,"source":"arxiv_source","source_observed_at":"2026-08-11T00:35:54.741970Z"},"links":{"cited_paper":"/paper/2302.04475","citing_paper":"/paper/2608.07724"},"observation_digest":"sha256:5e629a9e2a4d4e3496d80a28a8512e0d3f2d3862c702bff546d36407dcfd72d4","observation_id":"83f41038-b4ec-423b-8eed-4229a9080b63","resolution":{"observed_at":"2026-08-11T00:35:57.893975Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:35:54.746815Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.07724","last_updated":"2026-08-07T19:28:37Z","snapshot_observed_at":"2026-08-14T21:45:01.249275Z","submitted_at":"2026-08-07T19:28:37Z","title":"Communication-efficient parallel Bruhat decomposition","version":1},"reference_index":95,"source":"arxiv_source","source_observed_at":"2026-08-11T00:35:54.746815Z"},"links":{"citing_paper":"/paper/2608.07724"},"observation_digest":"sha256:0304f19e9130f99b908dc5450127a064bc5127e5c84655b70e7b240c568486c3","observation_id":"fac81832-5a7e-4cfe-8abd-1360be31ed8a","resolution":{"observed_at":"2026-08-11T00:35:54.746815Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.icalp.2024.30","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:35:56.569146Z","title":"doi:10.4230/LIPIcs.ICALP.2024.30 , file =","venue":null,"work_id":"6e1bf681-f9cc-481e-aefe-352467c0a8cf","year":2024},"citing_paper":{"arxiv_id":"2608.07724","last_updated":"2026-08-07T19:28:37Z","snapshot_observed_at":"2026-08-14T21:45:01.249275Z","submitted_at":"2026-08-07T19:28:37Z","title":"Communication-efficient parallel Bruhat decomposition","version":1},"reference_index":96,"source":"arxiv_source","source_observed_at":"2026-08-11T00:35:54.751245Z"},"links":{"citing_paper":"/paper/2608.07724"},"observation_digest":"sha256:359f4b753f808462dab95cdfe74b67796409540b8ed5066d564e54c24769f114","observation_id":"68e28c28-53dc-4f52-9dd7-217f3e7ffb8f","resolution":{"observed_at":"2026-08-11T00:35:56.574270Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-11T01:08:31.713747+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-11T01:08:31.713747+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:35:54.755999Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.07724","last_updated":"2026-08-07T19:28:37Z","snapshot_observed_at":"2026-08-14T21:45:01.249275Z","submitted_at":"2026-08-07T19:28:37Z","title":"Communication-efficient parallel Bruhat decomposition","version":1},"reference_index":97,"source":"arxiv_source","source_observed_at":"2026-08-11T00:35:54.755999Z"},"links":{"citing_paper":"/paper/2608.07724"},"observation_digest":"sha256:5cc64cb35c52a40cc89d33342084a8480f67b7558d3c487d88625eb70a4c3301","observation_id":"b3d7f03f-bb2d-4e53-8e00-9744d40639a5","resolution":{"observed_at":"2026-08-11T00:35:54.755999Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:35:54.760271Z","title":"Numerische Mathematik , pages =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.07724","last_updated":"2026-08-07T19:28:37Z","snapshot_observed_at":"2026-08-14T21:45:01.249275Z","submitted_at":"2026-08-07T19:28:37Z","title":"Communication-efficient parallel Bruhat decomposition","version":1},"reference_index":98,"source":"arxiv_source","source_observed_at":"2026-08-11T00:35:54.760271Z"},"links":{"citing_paper":"/paper/2608.07724"},"observation_digest":"sha256:37336f176f32be053e4f612a3f6413fe7ec8624bb05c8fd36e726df9cc835c93","observation_id":"83908635-5a27-4472-8d5e-6d0a3add070e","resolution":{"observed_at":"2026-08-11T00:35:54.760271Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:35:54.764512Z","title":"Proceedings of Euro-Par , doi =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.07724","last_updated":"2026-08-07T19:28:37Z","snapshot_observed_at":"2026-08-14T21:45:01.249275Z","submitted_at":"2026-08-07T19:28:37Z","title":"Communication-efficient parallel Bruhat decomposition","version":1},"reference_index":99,"source":"arxiv_source","source_observed_at":"2026-08-11T00:35:54.764512Z"},"links":{"citing_paper":"/paper/2608.07724"},"observation_digest":"sha256:d46ef4082f5acb6ec0659925d9c52ea48964a557389aac048782d19ddb92a56c","observation_id":"e2805973-18ae-49e7-a8d1-e3a2361d3d87","resolution":{"observed_at":"2026-08-11T00:35:54.764512Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:35:54.768938Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.07724","last_updated":"2026-08-07T19:28:37Z","snapshot_observed_at":"2026-08-14T21:45:01.249275Z","submitted_at":"2026-08-07T19:28:37Z","title":"Communication-efficient parallel Bruhat decomposition","version":1},"reference_index":100,"source":"arxiv_source","source_observed_at":"2026-08-11T00:35:54.768938Z"},"links":{"citing_paper":"/paper/2608.07724"},"observation_digest":"sha256:b9c5ccc56162191246501d674d615ca3caafacc7b6a6f90e782a533080802683","observation_id":"e1aa3dbc-a2f3-4bf6-b30a-f8e49516adcd","resolution":{"observed_at":"2026-08-11T00:35:54.768938Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2608.07724","last_updated":"2026-08-07T19:28:37Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-14T21:45:01.249275Z","submitted_at":"2026-08-07T19:28:37Z","title":"Communication-efficient parallel Bruhat decomposition"},"reference_resolution":{"displayed":100,"state_counts":{"malformed_identifier":0,"metadata_mismatch":3,"parse_uncertain":4,"unresolved":77,"verified_exact":16,"verified_fuzzy":0},"total_outbound_references":300},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 100 of 300 outbound references and 0 inbound Pith citation observations for arXiv:2608.07724."}