{"as_of":"2026-08-15T20:13:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c06b4bfd6de170d7d3af2d9f9b2d8534c3346040bad2b11bdd8bcf95f3a8b8e0","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-15T19:37:12.745042Z","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:fb42b29dbd0b9cfe46825c55e253fc2cdf117c48eee68d04a3f62f46efaf04de","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-15T19:37:12.745042Z","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:b028c4b4f8cb86b64312c8eccfd1d0f7464f6fd25a4f8af404888341d863a94e","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-15T19:37:12.745042Z","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:c8f79b7b0c1cfbaad82d07fe7c5c5637e2cc544740057b699354eb7af1f8f6b7","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-15T19:37:12.745042Z","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:a1595fb9ae0828e795275b8f3e7614c726b80d2d31bdedf055ad88d8419d8007","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-15T19:37:12.745042Z","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:04c7011307c204e9d528bb8aa382a8c4abd5cc3c307940507adcd6731e18c353","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-15T19:37:12.745042Z","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:51a2cd882e21b6a33e097651ed84e419a9b53a0fa0027b06fc60ae72542ad1e4","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-15T19:37:12.745042Z","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:ba699d7704eb3a60471ac62d45f9b05db1fb452d82f31c53a2012eab7ade4aa9","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-15T19:37:12.745042Z","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:697256e62d86c57dcf19b402c3c91b035c4010ba11e17062e4dc426128bbafdf","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-15T19:37:12.745042Z","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:a50043fc113106304ee42c1ed5cadde498f42e1f32fa1ae89d83dad5b54f8cd6","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-15T19:37:12.745042Z","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:ade98065d3dd1f7de059b8f5de03b427176ad6d25120ce2445dcd4e3699dd99f","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-15T19:37:12.745042Z","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:1a9513e1a2385f055f9cec839a9226313414e4c0bb002aa44f22f90baf7b4523","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-15T19:37:12.745042Z","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:9e9295eecea9c9c76caae077f25aac8def0cc4527ac506b5cacfa9d7e0e575c7","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-15T19:37:12.745042Z","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:741328d5623e2834a79bba4dd577d1aecf5d780f651fe9c3f964d5876826b99f","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-15T19:37:12.745042Z","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:c90e9c4a6af5731fc6e09374015ef56a5707349a760439959aca5d46fe1f8caa","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-15T19:37:12.745042Z","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:4ee5ada30ec1864c1da6cb87adf725007f8cc4413cbb803aefc992581c4a48b8","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-15T19:37:12.745042Z","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:45fad5486ccb42a0876a80f3decc3963377d6e8b3d622260b46f3e3ed9a9c130","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-15T19:37:12.745042Z","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:bac4b84b8d18ce1d9caee33ae2b1ca13f17bf504fe646fa958a82b09f9d314b1","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-15T19:37:12.745042Z","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:23263c9672ebf3fc0f77a801fcb4dae2e1cf3079c2b20953213388307c42960f","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-15T19:37:12.745042Z","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:b9dd8263b5ac2785b0497abb000eb6e0eb670b09ca56ed8955638414a82b1d30","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-15T19:37:12.745042Z","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:a6c224803fbbffdd8afbddcd7c6d3bfe5cb3594b1da800c65b829b05f8f79fb5","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-15T19:37:12.745042Z","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:72d15188c56a7ee79faba4634d0f1af59c6fa862fb363e64a1c0a2a5df7157e9","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-15T19:37:12.745042Z","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:77b3373d38fed9e22cef4f92f96aa216c7b4b85d446170d0cde7113cb4760849","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-15T19:37:12.745042Z","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:4d2ec111df84b11cd5a93cccd43276d076a4986ae78aeeefbcf13d7adcaf4ed2","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-15T19:37:12.745042Z","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:606500cd5d3edb515f480f755e15f03cbad2893af597f184511463b46b799ff9","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-15T19:37:12.745042Z","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:10cb35ab4da982484442e4dbe612842abd59cf235310565443ed0589e685d57a","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-15T19:37:12.745042Z","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:51d21b427eef52c50fb6d9977766d2ce331f9b854889a232c96e5ce0a5c7a7a0","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-15T19:37:12.745042Z","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:c2de05f75bdb69723b6166147f7125c4a1248b1a0635682f9bd4fa9d53cacb3b","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-15T19:37:12.745042Z","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:7f2886ec7183da30ceba1a99c9c5ca830cd3649fd5de32134fe7cb556ea7e95f","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-15T19:37:12.745042Z","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:c44585a948c02f00b64948659e13a76b3fa967610787d37e5c30d94c53529f8e","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-15T19:37:12.745042Z","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:e35ecd9a8ebc34add1266528d6d01a932a666b6dfc3c6071d440f75653544d59","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-15T19:37:12.745042Z","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:275b4b4a848e9c81875e8f6cae53b6d66339b5cad9f2f1eaf39c2669573da379","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-15T19:37:12.745042Z","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:afc0944cddb2e83f6cd93b99e882a632addba321237f9695f635bb2dfa878160","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-15T19:37:12.745042Z","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:026bdd7fc12652fbf4695ab12c41a781c7b51852dae23973af8df4a8c4bc73d3","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-15T19:37:12.745042Z","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:7afd0a60d2145ed4109864415ad31b8b689b1b345d2d34919f9390373a678268","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-15T19:37:12.745042Z","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:cbd58ef24b2e12091fe658db101624919095dc4e9ceaa0502e4248a5dcc1d34c","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-15T19:37:12.745042Z","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:472c5ea8388e1386fa08798068b74c4ffe3f92e09d8c3f304fcc7f1c37968d80","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-15T19:37:12.745042Z","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:a479d82c7cc0540274825872c6c0e24f3f3e8821aa9aa32e1dc7e47077a7a121","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-15T19:37:12.745042Z","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:0ae7e181a5b6adba54359da135444c232c0f1813e8484905c5e1f4576adab894","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-15T19:37:12.745042Z","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:8cc9ba97057fafa10b463b66d8ab77299bdaa758e56b14d8413eda341f23d1d8","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-15T19:37:12.745042Z","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:1ffc6f8f56a6bbf7e808b32172e2e0ab5cceb0449bab390ad9918ed734e4d6eb","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-15T19:37:12.745042Z","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:0111d6fb8b0b874d3641595527066357d85c22f1b8ee46cfbc50c2cda3d11425","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-15T19:37:12.745042Z","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:919d3d52de9075f7f28be8a8b26ccd44c513dead26830dc4198d7068ee5d8003","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-15T19:37:12.745042Z","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:fc4113d818ed73b1f04ab7ef3572c4c44e6348c611263090e2bef2b5de5fee71","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-15T19:37:12.745042Z","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:fa5033a9ddde465b3540b43b6b0ab76bdd3f223feb3ddf86d7e5e7e39d109f5b","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-15T19:37:12.745042Z","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:195a5ff7ff4a46a6c8785295dd81bd974d4e0b539e924fa35a2d474ff3bfb8d8","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-15T19:37:12.745042Z","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:b0d88db787daf871c47aeb6eb4784165999e83cb0c9cdf45bb72b125bf6dab31","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-15T19:37:12.745042Z","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:f709e1a0bf0fde10fa417d6d82001afc9b1f538e278beeacb332d9642befe49f","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-15T19:37:12.745042Z","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:8dfba5ec256c3c309f3f9788805e6317e007016fcf811b5eb4898b713ce726b8","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-15T19:37:12.745042Z","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:dcd9184c088a29b695a008a88aba65bf0d76907c8986b99b39c7997be33cf736","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-15T19:37:12.745042Z","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:42995230e78aa0867378dd1ec97d9da0bf38cae8d3cbcc8730d7ba4b33e77fc6","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-15T19:37:12.745042Z","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:17e7dcb84c32ac2feee14434bc3ee1e70724ff090272def7ef6e26bbe90e0477","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-15T19:37:12.745042Z","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:0c0c23096ae40b89723f04993f8c50ffac50a6081a6f2d21b2bd01ed8ee23939","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-15T19:37:12.745042Z","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:2a3cae80ebbd477948c5ffeb4178a444038ff349a9c6f5db5f454ba8bf89e5f5","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-15T19:37:12.745042Z","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:7405d5b397434a74fc9079edc50dbac3e8bc9e1c203651efe5dee22674cbcf71","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-15T19:37:12.745042Z","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:8520c85f330cb314b46fb871fdeb9243c90b09ccf16868dbc3520afc545fc8c2","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-15T19:37:12.745042Z","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:0df2270e6e685b224926faac1def843494708f522cb43d59629fa3801c0ac5ed","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-15T19:37:12.745042Z","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:d074a54dcdcb7d1e6f129a3ed92c23c7b262099d02a681a8133d691aef190e07","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-15T19:37:12.745042Z","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:36310f1e02654d36017d723d4fd4b18ceaf898eaec2d850a6c2e7dfcc917fc08","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-15T19:37:12.745042Z","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:6fd584c70abfe0944b35e3eb08db01e0809f797c68df2724155bba62e7301f2a","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-15T19:37:12.745042Z","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:63aa6ae349919ccdc11cfbebcb1e6ea5ddfff633b991063fbe8dad69aca81812","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-15T19:37:12.745042Z","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:99703294bd265a42c8502cdcaa55834a03b550e4537a5674f5e14da87de4e64f","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-15T19:37:12.745042Z","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:720cbebb84be07f379ec3fd99d19600170a7c04b11021de194b1f1ea61aa6b05","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-15T19:37:12.745042Z","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:5878874b383a28b5c51da4def6d00914a5c56ec3dfc578e098556b5bf92b32ed","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-15T19:37:12.745042Z","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:260621f756c72fed119e4021a176bf252defb162b869183ad7941a3e844f32ba","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-15T19:37:12.745042Z","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:f4bff21af7cfc9ffa4c820415f9fd80f904c2215c0a21705ce248b2eafcd8252","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-15T19:37:12.745042Z","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:58ba46666e5250571181cdb7d51b8935498085a6c747bdb309ffee33860b8ea5","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-15T19:37:12.745042Z","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:5aa1a68153b02f912c5c859cb7ebcd89e216a5773a115bbde7a5ddd76ba181e7","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-15T19:37:12.745042Z","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:2babaf885b5f66afe30081c1fa1e390733fc683fa5b633b732a6ae463d73963d","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-15T19:37:12.745042Z","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:3b6990a289e721b91ccdaf2231374588a7020e7c9ab7e0b143dc365d73b2befd","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-15T19:37:12.745042Z","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:33246c4f8cae56aac2725c95b38e1911e1b260f13342f0fb6539914924b98841","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-15T19:37:12.745042Z","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:b81a8d6f423ab328cb5be41624abceb2d805e22e043d943a38d12a8470823b62","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-15T19:37:12.745042Z","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:b9d2c5cfd7e5689943538443a15926ad5edd203d1d7140891bd45d40266137f8","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-15T19:37:12.745042Z","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:af922854c54d54bcc879850e2df9ed74295c8b5a8015f260e1837d87e7fbdc8f","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-15T19:37:12.745042Z","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:40628e586aee0847ed5da8041175c135d8f5b86281ec2ba1eb7f1da589928ba2","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-15T19:37:12.745042Z","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:6199694195b44d12d9da1e8409f50875d9171b4776d099de59fc17e415d6b82f","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-15T19:37:12.745042Z","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:cef75d92242434d4eb665f56a70f70ad3f868dcb8302575d0b0635068790900c","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-15T19:37:12.745042Z","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:5a7e4b3f6a9fc735890e7c2703551e50456ebfb3e7a02f62bf150f3fa8959924","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-15T19:37:12.745042Z","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:e90f0387b2382ec45200a797b9af1ea53a2bf79dcd852e13528b47a2c23802a1","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-15T19:37:12.745042Z","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:9b718187f3bb46df65f1dc9b1fe12bf2523bdd450dd7f4f5884e20e5531f7089","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-15T19:37:12.745042Z","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:382ef97b3684dca45239c804650514a0334a8f28e9a75dc19ac42b993bb9565c","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-15T19:37:12.745042Z","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:46cdd0dc0b55095066a1fb319bfd5d3102221d94274dcad21da369f293ec5ec1","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-15T19:37:12.745042Z","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:ee2bff82001c7d808d971f90a4b18e51415c199ac7d3bdca01b434f7fd250bb3","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-15T19:37:12.745042Z","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:349a605e8d5a42a4ca1152c372206e6be5b07755e189c49eeef38e620da283ee","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-15T19:37:12.745042Z","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:d83eff6c0767b4b3a0c3c870f4c7bdf24df9bd4bba4c3145711054316023826b","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-15T19:37:12.745042Z","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:50167e7694eb241a565543b29611f157d3ae6a22e80801894d3e195ded697665","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-15T19:37:12.745042Z","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:cebef85d9d000e82bed047f76566bb099d1278d45b4ac2745846b2e78eed58c9","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-15T19:37:12.745042Z","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:b1bccda81f97f76bb9dc730f838735216d2c6207d6eb2255b5b7437b7906b929","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-15T19:37:12.745042Z","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:cab21af3b994d43c8c995266f94667f3df2055d7e46f3e1e5b7208585070749a","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-15T19:37:12.745042Z","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:b896b2b022858945efec6972fa78f6bac2f0e988e38a0a1d4f1f239ddb1d483b","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-15T19:37:12.745042Z","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:6321d33246f5745c15b6fe709e3d83be5422b3bda671a5689f068445988d42d0","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-15T19:37:12.745042Z","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:a3b6511fe6c7b091d7d54134d7c030f1873fa768398d5f47527836623e1996b5","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-15T19:37:12.745042Z","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:0da8bf8948f3fd98a5f2734cbae64d02c4fc830b2dd0bc12018e8ad1a462be91","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-15T19:37:12.745042Z","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:b6c295b0e5b000bf1b40f0f02cbd52680a34ac0aaa80fd32379756f02ab78666","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-15T19:37:12.745042Z","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:1b0dbe106707fcc0c98680eda29bb49bddfd1de3b2fef55433f0d91d86d57af5","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-15T19:37:12.745042Z","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:2434f6074aeb699e1f087279d523dfa30f5afc738f0128ab7c34e38b3243de9d","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-15T19:37:12.745042Z","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:571d53ed433023e05467b22741e90e57829134d6a3e83a20a587bb7fa9a8cc5f","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-15T19:37:12.745042Z","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:c377d1e1359d07ecf00359977e3d262a93552847ac8c50233295353182ef5d46","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-15T19:37:12.745042Z","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:1ca67d34fd0295d9cf4bb6b0e5536476fc6140fa7cf5dab26368f497bc467d9e","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-15T19:37:12.745042Z","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:28fe1ad132768ddc4700d081d93de7e500767a793d6714e1ec2f94f855ddb21f","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-15T19:37:12.745042Z","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:7836af38e4be637349d368d06a1dfe138777adc8cdad2ad6cca2d5e903fcc1e5","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-15T19:37:12.745042Z","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."}