{"as_of":"2026-08-09T14:08:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:bdfbacb3c906ae4508b46129e80e80d1412c21f3fe42c2313d5f7e4b1f81c277","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-08T20:29:45.087026Z","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-09T06:31:02.800959+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/2502.05063/citation-record","integrity":"/paper/2502.05063/integrity","json":"/paper/2502.05063/citation-record.json","paper":"/paper/2502.05063"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:29:43.877929Z","title":"Hypha: A framework based on separation of parallelisms to accelerate persistent homology matrix reduc- tion,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2502.05063","last_updated":"2025-02-07T16:35:06Z","snapshot_observed_at":"2026-08-09T01:26:15.755794Z","submitted_at":"2025-02-07T16:35:06Z","title":"Computing and Learning on Combinatorial Data","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-08T20:29:43.877929Z"},"links":{"citing_paper":"/paper/2502.05063"},"observation_digest":"sha256:fe6c74002629831136d83cd4e202b2ff808eda574afc1cc68073b0a718b2be2e","observation_id":"e09a161a-d271-49e2-afaf-fbcb6a90e72d","resolution":{"observed_at":"2026-08-08T20:29:43.877929Z","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-08T20:29:43.882501Z","title":"Gpu-accelerated computation of Vietoris-Rips persistence barcodes,","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2502.05063","last_updated":"2025-02-07T16:35:06Z","snapshot_observed_at":"2026-08-09T01:26:15.755794Z","submitted_at":"2025-02-07T16:35:06Z","title":"Computing and Learning on Combinatorial Data","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-08T20:29:43.882501Z"},"links":{"citing_paper":"/paper/2502.05063"},"observation_digest":"sha256:1a9fc3b8701ab9b963732ffc81d96b6072dc05abfc7f07cfe1e759a0f1a49701","observation_id":"62248231-884f-45a8-829c-7e4c6ff5c65d","resolution":{"observed_at":"2026-08-08T20:29:43.882501Z","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-08T20:29:43.886502Z","title":"GPU-accelerated computation of Vietoris-Rips persistence barcodes,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2502.05063","last_updated":"2025-02-07T16:35:06Z","snapshot_observed_at":"2026-08-09T01:26:15.755794Z","submitted_at":"2025-02-07T16:35:06Z","title":"Computing and Learning on Combinatorial Data","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-08T20:29:43.886502Z"},"links":{"citing_paper":"/paper/2502.05063"},"observation_digest":"sha256:043c033a41e99b291962366fd969e4cc8f5d8f3983f8f88c138f60f27414cb3e","observation_id":"1760e1b9-43f9-4c1b-8125-98253829053d","resolution":{"observed_at":"2026-08-08T20:29:43.886502Z","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-08T20:29:43.890621Z","title":"Approximating 1-wasserstein distance between persis- tence diagrams by graph sparsification,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.05063","last_updated":"2025-02-07T16:35:06Z","snapshot_observed_at":"2026-08-09T01:26:15.755794Z","submitted_at":"2025-02-07T16:35:06Z","title":"Computing and Learning on Combinatorial Data","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-08T20:29:43.890621Z"},"links":{"citing_paper":"/paper/2502.05063"},"observation_digest":"sha256:ba285bdf2babdc90f291d6d0978f454da3f2f084ceb7a4ef7fdc558ca141eaf1","observation_id":"d9ffb6eb-d9ee-40d7-b576-c49f3c2d0935","resolution":{"observed_at":"2026-08-08T20:29:43.890621Z","resolver_source":null,"status":"malformed_identifier"},"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-08T20:29:43.897962Z","title":"Gefl: Extended filtration learning for graph classification,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.05063","last_updated":"2025-02-07T16:35:06Z","snapshot_observed_at":"2026-08-09T01:26:15.755794Z","submitted_at":"2025-02-07T16:35:06Z","title":"Computing and Learning on Combinatorial Data","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-08T20:29:43.897962Z"},"links":{"citing_paper":"/paper/2502.05063"},"observation_digest":"sha256:ab2233d4a1d1dd13cda2d176a38d293604b0b00ccc66f6a277b34fc3eede0581","observation_id":"eec1360a-495e-4856-a378-cc1a7d38e78d","resolution":{"observed_at":"2026-08-08T20:29:43.897962Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.11339","last_updated":"2024-12-03T03:42:45Z","snapshot_observed_at":"2026-07-06T17:31:37.574049Z","submitted_at":"2024-02-17T17:13:41Z","title":"Expressive Higher-Order Link Prediction through Hypergraph Symmetry Breaking","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.11339","snapshot_observed_at":"2026-08-08T20:29:43.902034Z","title":"Expressive higher-order link prediction through hypergraph symmetry breaking,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.05063","last_updated":"2025-02-07T16:35:06Z","snapshot_observed_at":"2026-08-09T01:26:15.755794Z","submitted_at":"2025-02-07T16:35:06Z","title":"Computing and Learning on Combinatorial Data","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-08T20:29:43.902034Z"},"links":{"cited_paper":"/paper/2402.11339","citing_paper":"/paper/2502.05063"},"observation_digest":"sha256:bcf612b363b8c3e975c1ceb189a89541e0d5940910dc0bc3ab7ccbb45dc7b1a1","observation_id":"a76bf171-7e70-4078-814a-d5c47ced45a7","resolution":{"observed_at":"2026-08-08T20:29:43.902034Z","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-08T20:29:43.906539Z","title":"Expressive higher-order link prediction through hypergraph symmetry breaking,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.05063","last_updated":"2025-02-07T16:35:06Z","snapshot_observed_at":"2026-08-09T01:26:15.755794Z","submitted_at":"2025-02-07T16:35:06Z","title":"Computing and Learning on Combinatorial Data","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-08T20:29:43.906539Z"},"links":{"citing_paper":"/paper/2502.05063"},"observation_digest":"sha256:2ee29ce2f8444509d3dcfe8cc8115b8f572a26e6baea9643f37e0288d3230533","observation_id":"0a8c9d87-aefe-43c4-9c95-fa9ea61b7198","resolution":{"observed_at":"2026-08-08T20:29:43.906539Z","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-08T20:29:43.909844Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2502.05063","last_updated":"2025-02-07T16:35:06Z","snapshot_observed_at":"2026-08-09T01:26:15.755794Z","submitted_at":"2025-02-07T16:35:06Z","title":"Computing and Learning on Combinatorial Data","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-08T20:29:43.909844Z"},"links":{"citing_paper":"/paper/2502.05063"},"observation_digest":"sha256:06937785d130529fdcc16c85e9ae1431f4400008e40676e3f6e75e324a44a10e","observation_id":"0ac5041d-273f-4d94-8ec0-43fa0030885d","resolution":{"observed_at":"2026-08-08T20:29:43.909844Z","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-08T20:29:43.913248Z","title":"Survey article: The real numbers–a survey of constructions,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2502.05063","last_updated":"2025-02-07T16:35:06Z","snapshot_observed_at":"2026-08-09T01:26:15.755794Z","submitted_at":"2025-02-07T16:35:06Z","title":"Computing and Learning on Combinatorial Data","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-08T20:29:43.913248Z"},"links":{"citing_paper":"/paper/2502.05063"},"observation_digest":"sha256:179b39681def997a7bf58a3c6308860cddb4e44af5d0e93c27ac41921ecfb3c6","observation_id":"305d64fb-e1f1-44da-8905-82aa2bf919eb","resolution":{"observed_at":"2026-08-08T20:29:43.913248Z","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-08T20:29:43.916355Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.05063","last_updated":"2025-02-07T16:35:06Z","snapshot_observed_at":"2026-08-09T01:26:15.755794Z","submitted_at":"2025-02-07T16:35:06Z","title":"Computing and Learning on Combinatorial Data","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-08T20:29:43.916355Z"},"links":{"citing_paper":"/paper/2502.05063"},"observation_digest":"sha256:b0409b7085aa1609053e5bbbd81a3fc2dbbea5da935f0472c2f5ae9925d86e30","observation_id":"953b0a7c-361a-4689-a047-aab42bb0cc53","resolution":{"observed_at":"2026-08-08T20:29:43.916355Z","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-08T20:29:43.919965Z","title":null,"venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2502.05063","last_updated":"2025-02-07T16:35:06Z","snapshot_observed_at":"2026-08-09T01:26:15.755794Z","submitted_at":"2025-02-07T16:35:06Z","title":"Computing and Learning on Combinatorial Data","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-08T20:29:43.919965Z"},"links":{"citing_paper":"/paper/2502.05063"},"observation_digest":"sha256:509ad1a8070153d8d5c7173818eb5087b0689e80559bf3168964cb0e68da03dc","observation_id":"ab91e5fc-2750-4f64-ab03-88ced5654bae","resolution":{"observed_at":"2026-08-08T20:29:43.919965Z","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-08T20:29:43.923240Z","title":"General theory of natural equivalences,","venue":null,"work_id":null,"year":1945},"citing_paper":{"arxiv_id":"2502.05063","last_updated":"2025-02-07T16:35:06Z","snapshot_observed_at":"2026-08-09T01:26:15.755794Z","submitted_at":"2025-02-07T16:35:06Z","title":"Computing and Learning on Combinatorial Data","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-08T20:29:43.923240Z"},"links":{"citing_paper":"/paper/2502.05063"},"observation_digest":"sha256:c17ba33b010324b64deaa421570c2a9c3bba4c741043dc0369d048796e02c271","observation_id":"dde6426a-5c03-4179-b64d-169f2beda74d","resolution":{"observed_at":"2026-08-08T20:29:43.923240Z","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-08T20:29:43.926886Z","title":"Acyclic categories,","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2502.05063","last_updated":"2025-02-07T16:35:06Z","snapshot_observed_at":"2026-08-09T01:26:15.755794Z","submitted_at":"2025-02-07T16:35:06Z","title":"Computing and Learning on Combinatorial Data","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-08T20:29:43.926886Z"},"links":{"citing_paper":"/paper/2502.05063"},"observation_digest":"sha256:437f8f18d15ca38fd8f245ef1042b66661d2a99d06f1d1e5d561f63598316d9b","observation_id":"04adaad2-f9a4-42d3-8194-a78e6f26ce86","resolution":{"observed_at":"2026-08-08T20:29:43.926886Z","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-08T20:29:43.930980Z","title":"Quiver representations,","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2502.05063","last_updated":"2025-02-07T16:35:06Z","snapshot_observed_at":"2026-08-09T01:26:15.755794Z","submitted_at":"2025-02-07T16:35:06Z","title":"Computing and Learning on Combinatorial Data","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-08T20:29:43.930980Z"},"links":{"citing_paper":"/paper/2502.05063"},"observation_digest":"sha256:c4f4f163486c1ed02161c2315e4eadffb4bec34f5bdb2186343f1ef988fda3fc","observation_id":"a670d753-2bcf-405f-8ddd-bdfc0bddea9c","resolution":{"observed_at":"2026-08-08T20:29:43.930980Z","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-08T20:29:43.934612Z","title":"Ueber die theorie der algebraischen formen,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.05063","last_updated":"2025-02-07T16:35:06Z","snapshot_observed_at":"2026-08-09T01:26:15.755794Z","submitted_at":"2025-02-07T16:35:06Z","title":"Computing and Learning on Combinatorial Data","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-08T20:29:43.934612Z"},"links":{"citing_paper":"/paper/2502.05063"},"observation_digest":"sha256:7068f0775b352b3c3336c07a31d7bf873f9f1ecb0b5b8417ac776198246a20de","observation_id":"6381b1a2-6715-40ba-9527-95b716442820","resolution":{"observed_at":"2026-08-08T20:29:43.934612Z","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-08T20:29:43.938174Z","title":null,"venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2502.05063","last_updated":"2025-02-07T16:35:06Z","snapshot_observed_at":"2026-08-09T01:26:15.755794Z","submitted_at":"2025-02-07T16:35:06Z","title":"Computing and Learning on Combinatorial Data","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-08T20:29:43.938174Z"},"links":{"citing_paper":"/paper/2502.05063"},"observation_digest":"sha256:d58058d49fbb801924e14db2f1d4dd4eac7c201fe013cff945ccd1786dd4f859","observation_id":"261beafa-3dc9-4311-93b9-7eb227545dc3","resolution":{"observed_at":"2026-08-08T20:29:43.938174Z","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-08T20:29:43.945627Z","title":"Hoffman and R","venue":null,"work_id":null,"year":1961},"citing_paper":{"arxiv_id":"2502.05063","last_updated":"2025-02-07T16:35:06Z","snapshot_observed_at":"2026-08-09T01:26:15.755794Z","submitted_at":"2025-02-07T16:35:06Z","title":"Computing and Learning on Combinatorial Data","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-08T20:29:43.945627Z"},"links":{"citing_paper":"/paper/2502.05063"},"observation_digest":"sha256:1cd8655bec73755c1bfe62ed37742987b8f7ff4eb4e577df643616f5bb9a9912","observation_id":"be121d98-bf02-44be-a932-1102f2bd4963","resolution":{"observed_at":"2026-08-08T20:29:43.945627Z","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-08T20:29:43.981799Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2502.05063","last_updated":"2025-02-07T16:35:06Z","snapshot_observed_at":"2026-08-09T01:26:15.755794Z","submitted_at":"2025-02-07T16:35:06Z","title":"Computing and Learning on Combinatorial Data","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-08T20:29:43.981799Z"},"links":{"citing_paper":"/paper/2502.05063"},"observation_digest":"sha256:a002f96128458169e1395592aa67ef5b2b8f3890c1250b50a53330895073b052","observation_id":"eae74ea5-4219-42f0-8db0-7b2639259a6d","resolution":{"observed_at":"2026-08-08T20:29:43.981799Z","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-08T20:29:44.032231Z","title":"Idealtheorie in ringbereichen,","venue":null,"work_id":null,"year":1921},"citing_paper":{"arxiv_id":"2502.05063","last_updated":"2025-02-07T16:35:06Z","snapshot_observed_at":"2026-08-09T01:26:15.755794Z","submitted_at":"2025-02-07T16:35:06Z","title":"Computing and Learning on Combinatorial Data","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-08T20:29:44.032231Z"},"links":{"citing_paper":"/paper/2502.05063"},"observation_digest":"sha256:965db19973cb5a185ef6986c82464e42a5a3235916f913a102f7ce66ed8fe052","observation_id":"21224dc1-9ddb-4dd1-8946-9aa1bc74eeda","resolution":{"observed_at":"2026-08-08T20:29:44.032231Z","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-08T20:29:44.136012Z","title":null,"venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2502.05063","last_updated":"2025-02-07T16:35:06Z","snapshot_observed_at":"2026-08-09T01:26:15.755794Z","submitted_at":"2025-02-07T16:35:06Z","title":"Computing and Learning on Combinatorial Data","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-08T20:29:44.136012Z"},"links":{"citing_paper":"/paper/2502.05063"},"observation_digest":"sha256:0fa894811f7d6e33814b976aabc1fb8319e8d42c3da377c06ab84ceb5c8e6de2","observation_id":"b69d0f1e-06be-4cba-aa9d-6bd2732200eb","resolution":{"observed_at":"2026-08-08T20:29:44.136012Z","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-08T20:29:44.171848Z","title":"The group of isometries of a riemannian manifold,","venue":null,"work_id":null,"year":1939},"citing_paper":{"arxiv_id":"2502.05063","last_updated":"2025-02-07T16:35:06Z","snapshot_observed_at":"2026-08-09T01:26:15.755794Z","submitted_at":"2025-02-07T16:35:06Z","title":"Computing and Learning on Combinatorial Data","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-08T20:29:44.171848Z"},"links":{"citing_paper":"/paper/2502.05063"},"observation_digest":"sha256:95701c21c9fbb3d30b71b6a4555373e9c0127958bc20660f40b0b566d38c6413","observation_id":"276ee7ab-c173-4837-8fd0-f7ab3c565279","resolution":{"observed_at":"2026-08-08T20:29:44.171848Z","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-08T20:29:44.220385Z","title":"Boyd and L","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2502.05063","last_updated":"2025-02-07T16:35:06Z","snapshot_observed_at":"2026-08-09T01:26:15.755794Z","submitted_at":"2025-02-07T16:35:06Z","title":"Computing and Learning on Combinatorial Data","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-08T20:29:44.220385Z"},"links":{"citing_paper":"/paper/2502.05063"},"observation_digest":"sha256:31272c46624a89c597fa667ef32407cfcdd3df209184396a46afc49bad67aba2","observation_id":"f27cc0e0-7f9c-4137-b12f-9d9f483b62ef","resolution":{"observed_at":"2026-08-08T20:29:44.220385Z","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-08T20:29:44.250003Z","title":null,"venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2502.05063","last_updated":"2025-02-07T16:35:06Z","snapshot_observed_at":"2026-08-09T01:26:15.755794Z","submitted_at":"2025-02-07T16:35:06Z","title":"Computing and Learning on Combinatorial Data","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-08T20:29:44.250003Z"},"links":{"citing_paper":"/paper/2502.05063"},"observation_digest":"sha256:96c34c077296f111fda4ccbd98301384b45f98c1cbc1943bf4709d355ca3db51","observation_id":"eb6c33d9-f114-4f5a-8b7f-b0ab6dddf0d5","resolution":{"observed_at":"2026-08-08T20:29:44.250003Z","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-08T20:29:44.310777Z","title":"Causal inference in statistics: An overview,","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2502.05063","last_updated":"2025-02-07T16:35:06Z","snapshot_observed_at":"2026-08-09T01:26:15.755794Z","submitted_at":"2025-02-07T16:35:06Z","title":"Computing and Learning on Combinatorial Data","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-08T20:29:44.310777Z"},"links":{"citing_paper":"/paper/2502.05063"},"observation_digest":"sha256:ecc15cdce1dcf9235bdda5a250b01d2d1d2d39f7d77e8a2c3db6861acf088dba","observation_id":"59603916-bc83-4015-ba36-bd9d8f674ef5","resolution":{"observed_at":"2026-08-08T20:29:44.310777Z","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-08T20:29:44.327725Z","title":"Pearl, Causality","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2502.05063","last_updated":"2025-02-07T16:35:06Z","snapshot_observed_at":"2026-08-09T01:26:15.755794Z","submitted_at":"2025-02-07T16:35:06Z","title":"Computing and Learning on Combinatorial Data","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-08T20:29:44.327725Z"},"links":{"citing_paper":"/paper/2502.05063"},"observation_digest":"sha256:e069488c5cf623d4740ffea5c777ac6db0107bb497fa1d28cb07368afea03c79","observation_id":"f6afc2c2-bc16-43ae-8270-6652a3e9d25b","resolution":{"observed_at":"2026-08-08T20:29:44.327725Z","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-08T20:29:44.331590Z","title":"Birkhoff, Lattice theory","venue":null,"work_id":null,"year":1940},"citing_paper":{"arxiv_id":"2502.05063","last_updated":"2025-02-07T16:35:06Z","snapshot_observed_at":"2026-08-09T01:26:15.755794Z","submitted_at":"2025-02-07T16:35:06Z","title":"Computing and Learning on Combinatorial Data","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-08T20:29:44.331590Z"},"links":{"citing_paper":"/paper/2502.05063"},"observation_digest":"sha256:34b37e5ec3a678034535ab9db72d7c7d778235ea170cc089af4d1e9d5515ecab","observation_id":"6cf99b00-8699-4a0b-84e4-bb0ee7fc8d91","resolution":{"observed_at":"2026-08-08T20:29:44.331590Z","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-08T20:29:44.335520Z","title":"Schiffler, Quiver representations","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2502.05063","last_updated":"2025-02-07T16:35:06Z","snapshot_observed_at":"2026-08-09T01:26:15.755794Z","submitted_at":"2025-02-07T16:35:06Z","title":"Computing and Learning on Combinatorial Data","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-08T20:29:44.335520Z"},"links":{"citing_paper":"/paper/2502.05063"},"observation_digest":"sha256:c70e6287e37b78950ecbf21a26a4046f6d82dbd4f371ed1dd7e09dfaeb28f7d2","observation_id":"62b623cc-2634-4e6c-92af-1f9d07f1165f","resolution":{"observed_at":"2026-08-08T20:29:44.335520Z","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-08T20:29:44.339685Z","title":"Steele, The Persistence of Memory (1931) by Salvador Dali (CC BY-NC-ND 2.0)","venue":null,"work_id":null,"year":1931},"citing_paper":{"arxiv_id":"2502.05063","last_updated":"2025-02-07T16:35:06Z","snapshot_observed_at":"2026-08-09T01:26:15.755794Z","submitted_at":"2025-02-07T16:35:06Z","title":"Computing and Learning on Combinatorial Data","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-08T20:29:44.339685Z"},"links":{"citing_paper":"/paper/2502.05063"},"observation_digest":"sha256:d4b79e3e4a9c4f07896a4179ec00e03e4570a1bbe6ed2371dab2f7fea1eea8e7","observation_id":"ddbaaa2b-1b6c-47bb-8f89-7e92470e9a91","resolution":{"observed_at":"2026-08-08T20:29:44.339685Z","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-08T20:29:44.343729Z","title":"Unzerlegbare darstellungen i,","venue":null,"work_id":null,"year":1972},"citing_paper":{"arxiv_id":"2502.05063","last_updated":"2025-02-07T16:35:06Z","snapshot_observed_at":"2026-08-09T01:26:15.755794Z","submitted_at":"2025-02-07T16:35:06Z","title":"Computing and Learning on Combinatorial Data","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-08T20:29:44.343729Z"},"links":{"citing_paper":"/paper/2502.05063"},"observation_digest":"sha256:6e6c72445ee9488053be9c6f9019952723c7d4c37455750ebabdd5240d36f1c0","observation_id":"bd7a9fe4-3c16-4337-941a-6fb392ab2d75","resolution":{"observed_at":"2026-08-08T20:29:44.343729Z","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-08T20:29:44.347828Z","title":"Topological sorting of large networks,","venue":null,"work_id":null,"year":1962},"citing_paper":{"arxiv_id":"2502.05063","last_updated":"2025-02-07T16:35:06Z","snapshot_observed_at":"2026-08-09T01:26:15.755794Z","submitted_at":"2025-02-07T16:35:06Z","title":"Computing and Learning on Combinatorial Data","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-08T20:29:44.347828Z"},"links":{"citing_paper":"/paper/2502.05063"},"observation_digest":"sha256:73b996fe3dd2b6e1e37e769a2c788dfcb3be5e34c4f895dcb322f33383751950","observation_id":"203b3832-e004-4022-9846-52c2d02a932a","resolution":{"observed_at":"2026-08-08T20:29:44.347828Z","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-08T20:29:44.352028Z","title":"Representations of quivers,","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2502.05063","last_updated":"2025-02-07T16:35:06Z","snapshot_observed_at":"2026-08-09T01:26:15.755794Z","submitted_at":"2025-02-07T16:35:06Z","title":"Computing and Learning on Combinatorial Data","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-08T20:29:44.352028Z"},"links":{"citing_paper":"/paper/2502.05063"},"observation_digest":"sha256:3da66804f41eea27f6e827712a28152597b5001f17a22da57064053eed6b5ecc","observation_id":"8bcade74-0772-44ed-a00e-f02c91e46028","resolution":{"observed_at":"2026-08-08T20:29:44.352028Z","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-08T20:29:44.356062Z","title":"Morin, Quiver algebras , 2014","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2502.05063","last_updated":"2025-02-07T16:35:06Z","snapshot_observed_at":"2026-08-09T01:26:15.755794Z","submitted_at":"2025-02-07T16:35:06Z","title":"Computing and Learning on Combinatorial Data","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-08T20:29:44.356062Z"},"links":{"citing_paper":"/paper/2502.05063"},"observation_digest":"sha256:7105ee60b2b38fce132ffd9f5cc38621e3ca061bed6083db163fccf1fcd86755","observation_id":"174df392-1424-4b9e-809f-322eccc4c42d","resolution":{"observed_at":"2026-08-08T20:29:44.356062Z","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-08T20:29:44.359919Z","title":"Infinite root systems, representations of graphs and invariant theory,","venue":null,"work_id":null,"year":1980},"citing_paper":{"arxiv_id":"2502.05063","last_updated":"2025-02-07T16:35:06Z","snapshot_observed_at":"2026-08-09T01:26:15.755794Z","submitted_at":"2025-02-07T16:35:06Z","title":"Computing and Learning on Combinatorial Data","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-08T20:29:44.359919Z"},"links":{"citing_paper":"/paper/2502.05063"},"observation_digest":"sha256:1945512d58f67404728a28e53c3832fa5644015f8d44e8822148707c00f8736d","observation_id":"c5179435-111e-427d-b66c-1a39c7d96cc2","resolution":{"observed_at":"2026-08-08T20:29:44.359919Z","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-08T20:29:44.363880Z","title":"Infinite root systems, representations of graphs and invariant theory, ii,","venue":null,"work_id":null,"year":1982},"citing_paper":{"arxiv_id":"2502.05063","last_updated":"2025-02-07T16:35:06Z","snapshot_observed_at":"2026-08-09T01:26:15.755794Z","submitted_at":"2025-02-07T16:35:06Z","title":"Computing and Learning on Combinatorial Data","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-08T20:29:44.363880Z"},"links":{"citing_paper":"/paper/2502.05063"},"observation_digest":"sha256:ec5b9b8d3f651cc9600fa1fbc7caf0df75f8091c77cc071ccb80dd38a0e2828a","observation_id":"c16b5687-220a-4cc7-aab6-3feb4d885aa8","resolution":{"observed_at":"2026-08-08T20:29:44.363880Z","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-08T20:29:44.367606Z","title":"A multiprocessor system design,","venue":null,"work_id":null,"year":1963},"citing_paper":{"arxiv_id":"2502.05063","last_updated":"2025-02-07T16:35:06Z","snapshot_observed_at":"2026-08-09T01:26:15.755794Z","submitted_at":"2025-02-07T16:35:06Z","title":"Computing and Learning on Combinatorial Data","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-08T20:29:44.367606Z"},"links":{"citing_paper":"/paper/2502.05063"},"observation_digest":"sha256:8a3f4e56726d0219ebb2cee1721a0c8712c84d61917db4f8628710b8f7aa5f69","observation_id":"ea0b9f6b-cc1e-4f5f-b545-f219f9376b34","resolution":{"observed_at":"2026-08-08T20:29:44.367606Z","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-08T20:29:44.371285Z","title":"A bridging model for parallel computation,","venue":null,"work_id":null,"year":1990},"citing_paper":{"arxiv_id":"2502.05063","last_updated":"2025-02-07T16:35:06Z","snapshot_observed_at":"2026-08-09T01:26:15.755794Z","submitted_at":"2025-02-07T16:35:06Z","title":"Computing and Learning on Combinatorial Data","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-08T20:29:44.371285Z"},"links":{"citing_paper":"/paper/2502.05063"},"observation_digest":"sha256:87550f72b63974b7add49f6a526fe8fe25418b061da0d1494dda030b57829fdf","observation_id":"c4d5aba1-a3f2-4c5c-8a32-5c178521fc43","resolution":{"observed_at":"2026-08-08T20:29:44.371285Z","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-08T20:29:44.375151Z","title":"Dot: A matrix model for analyzing, optimizing and deploying software for big data analytics in distributed systems,","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2502.05063","last_updated":"2025-02-07T16:35:06Z","snapshot_observed_at":"2026-08-09T01:26:15.755794Z","submitted_at":"2025-02-07T16:35:06Z","title":"Computing and Learning on Combinatorial Data","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-08T20:29:44.375151Z"},"links":{"citing_paper":"/paper/2502.05063"},"observation_digest":"sha256:3cc120c9e2c03c78670a61f01e324091b0e5e04b061a2e8adf8c6dd39c835c90","observation_id":"acf2eff1-33e9-4ffa-ad5f-d6ebc3cf0030","resolution":{"observed_at":"2026-08-08T20:29:44.375151Z","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-08T20:29:44.379130Z","title":"Mapreduce: Simplified data processing on large clusters,","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2502.05063","last_updated":"2025-02-07T16:35:06Z","snapshot_observed_at":"2026-08-09T01:26:15.755794Z","submitted_at":"2025-02-07T16:35:06Z","title":"Computing and Learning on Combinatorial Data","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-08T20:29:44.379130Z"},"links":{"citing_paper":"/paper/2502.05063"},"observation_digest":"sha256:81641f4769df46a10f916ae1a530206af7a40f310f74d087b49973cc1cc7efc2","observation_id":"5f94c6ca-0ad0-46cb-8a91-fedb281c07ee","resolution":{"observed_at":"2026-08-08T20:29:44.379130Z","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-08T20:29:44.382700Z","title":"The theory of multidimensional persistence,","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2502.05063","last_updated":"2025-02-07T16:35:06Z","snapshot_observed_at":"2026-08-09T01:26:15.755794Z","submitted_at":"2025-02-07T16:35:06Z","title":"Computing and Learning on Combinatorial Data","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-08T20:29:44.382700Z"},"links":{"citing_paper":"/paper/2502.05063"},"observation_digest":"sha256:0e7ccb5488cf5fcb905a0573a187a7bbc39814e89078cba3ab3d22062852c6df","observation_id":"f6562eee-331c-4ef1-b9ce-8bcd1135517c","resolution":{"observed_at":"2026-08-08T20:29:44.382700Z","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-08T20:29:44.386623Z","title":"Invariants and metrics for multiparameter persistent homology,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2502.05063","last_updated":"2025-02-07T16:35:06Z","snapshot_observed_at":"2026-08-09T01:26:15.755794Z","submitted_at":"2025-02-07T16:35:06Z","title":"Computing and Learning on Combinatorial Data","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-08T20:29:44.386623Z"},"links":{"citing_paper":"/paper/2502.05063"},"observation_digest":"sha256:7dfbcca8928ed6730ea3e7241d0d06a97b322204ff1c2aca546bf4ebbba2469a","observation_id":"1a43cbfb-dd38-44c1-871d-490ffaba2028","resolution":{"observed_at":"2026-08-08T20:29:44.386623Z","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-08T20:29:44.390484Z","title":"Stratifying multiparameter persistent homology,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2502.05063","last_updated":"2025-02-07T16:35:06Z","snapshot_observed_at":"2026-08-09T01:26:15.755794Z","submitted_at":"2025-02-07T16:35:06Z","title":"Computing and Learning on Combinatorial Data","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-08T20:29:44.390484Z"},"links":{"citing_paper":"/paper/2502.05063"},"observation_digest":"sha256:68fe7302be4fd5ef367292cf744e44e3d0f9725afeec6e3819be35d080344e9e","observation_id":"c62a79da-1b6f-466a-97af-22432d1fd3df","resolution":{"observed_at":"2026-08-08T20:29:44.390484Z","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-08T20:29:44.394113Z","title":"Generalized persistence diagrams for persistence modules over posets,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2502.05063","last_updated":"2025-02-07T16:35:06Z","snapshot_observed_at":"2026-08-09T01:26:15.755794Z","submitted_at":"2025-02-07T16:35:06Z","title":"Computing and Learning on Combinatorial Data","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-08T20:29:44.394113Z"},"links":{"citing_paper":"/paper/2502.05063"},"observation_digest":"sha256:75dd5d5504ad250e7d48a45ac667fabba8a64de1fde07cfddcb95013ddd89ff0","observation_id":"177846ee-9abe-40aa-8b4a-98f9189a1cfa","resolution":{"observed_at":"2026-08-08T20:29:44.394113Z","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-08T20:29:44.397156Z","title":"Computing generalized rank invariant for 2- parameter persistence modules via zigzag persistence and its applications,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.05063","last_updated":"2025-02-07T16:35:06Z","snapshot_observed_at":"2026-08-09T01:26:15.755794Z","submitted_at":"2025-02-07T16:35:06Z","title":"Computing and Learning on Combinatorial Data","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-08T20:29:44.397156Z"},"links":{"citing_paper":"/paper/2502.05063"},"observation_digest":"sha256:a7d44f6fd35b1cfc8041f333ece0eb888544ae9d0fdd46e39b32fdc11fedc211","observation_id":"04ce023a-527c-4187-9455-ca29248dc050","resolution":{"observed_at":"2026-08-08T20:29:44.397156Z","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-08T20:29:44.400634Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.05063","last_updated":"2025-02-07T16:35:06Z","snapshot_observed_at":"2026-08-09T01:26:15.755794Z","submitted_at":"2025-02-07T16:35:06Z","title":"Computing and Learning on Combinatorial Data","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-08T20:29:44.400634Z"},"links":{"citing_paper":"/paper/2502.05063"},"observation_digest":"sha256:8aa5d86d048cf9d3ff3a10755abc9aba3b30c33da2f5b71a670902ef25bdfc09","observation_id":"34ebae7f-7596-486f-8a5d-897293c344e7","resolution":{"observed_at":"2026-08-08T20:29:44.400634Z","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-08T20:29:44.404411Z","title":"The structure of semi-simple algebras,","venue":null,"work_id":null,"year":1947},"citing_paper":{"arxiv_id":"2502.05063","last_updated":"2025-02-07T16:35:06Z","snapshot_observed_at":"2026-08-09T01:26:15.755794Z","submitted_at":"2025-02-07T16:35:06Z","title":"Computing and Learning on Combinatorial Data","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-08T20:29:44.404411Z"},"links":{"citing_paper":"/paper/2502.05063"},"observation_digest":"sha256:0e0e12c47a756200c130f193d5b954c85758b6fce08206605acd715cc4e30675","observation_id":"b6b49e74-80d4-46e8-a468-f657de1ef8c4","resolution":{"observed_at":"2026-08-08T20:29:44.404411Z","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-08T20:29:44.408194Z","title":"Fulton and J","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2502.05063","last_updated":"2025-02-07T16:35:06Z","snapshot_observed_at":"2026-08-09T01:26:15.755794Z","submitted_at":"2025-02-07T16:35:06Z","title":"Computing and Learning on Combinatorial Data","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-08T20:29:44.408194Z"},"links":{"citing_paper":"/paper/2502.05063"},"observation_digest":"sha256:770519381026129b73793790d56acd049f5acaeece8b07d09693cd25eee5ce08","observation_id":"395b88b2-ef01-40af-a959-6e4495e72038","resolution":{"observed_at":"2026-08-08T20:29:44.408194Z","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-08T20:29:44.411712Z","title":"Zigzag persistence,","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2502.05063","last_updated":"2025-02-07T16:35:06Z","snapshot_observed_at":"2026-08-09T01:26:15.755794Z","submitted_at":"2025-02-07T16:35:06Z","title":"Computing and Learning on Combinatorial Data","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-08T20:29:44.411712Z"},"links":{"citing_paper":"/paper/2502.05063"},"observation_digest":"sha256:d2915ac67c3eb95f35e6f27692b9ac5e90ec484a03989d4546bea1d7005fb678","observation_id":"14ace23c-275a-458d-8e8d-6850a0cc6112","resolution":{"observed_at":"2026-08-08T20:29:44.411712Z","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-08T20:29:44.415180Z","title":"Strang, Linear algebra and its applications","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2502.05063","last_updated":"2025-02-07T16:35:06Z","snapshot_observed_at":"2026-08-09T01:26:15.755794Z","submitted_at":"2025-02-07T16:35:06Z","title":"Computing and Learning on Combinatorial Data","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-08T20:29:44.415180Z"},"links":{"citing_paper":"/paper/2502.05063"},"observation_digest":"sha256:b28262ae7ad73f5c3072a042f2514e56d776c9909b71aad52dd223a9e2a13614","observation_id":"687ac0ff-10ea-40f4-9f66-45533ab12668","resolution":{"observed_at":"2026-08-08T20:29:44.415180Z","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-08T20:29:44.419381Z","title":"Elder-rule-staircodes for augmented metric spaces,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2502.05063","last_updated":"2025-02-07T16:35:06Z","snapshot_observed_at":"2026-08-09T01:26:15.755794Z","submitted_at":"2025-02-07T16:35:06Z","title":"Computing and Learning on Combinatorial Data","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-08T20:29:44.419381Z"},"links":{"citing_paper":"/paper/2502.05063"},"observation_digest":"sha256:aa159ecf92c3d663b502a5fce6b9a4e1b9914b9670470ccba6368767a176fb91","observation_id":"3dafc3f6-e9a8-4cd9-898e-319e3770236f","resolution":{"observed_at":"2026-08-08T20:29:44.419381Z","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-08T20:29:44.422444Z","title":"S. eilenberg homological algebra,","venue":null,"work_id":null,"year":1956},"citing_paper":{"arxiv_id":"2502.05063","last_updated":"2025-02-07T16:35:06Z","snapshot_observed_at":"2026-08-09T01:26:15.755794Z","submitted_at":"2025-02-07T16:35:06Z","title":"Computing and Learning on Combinatorial Data","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-08T20:29:44.422444Z"},"links":{"citing_paper":"/paper/2502.05063"},"observation_digest":"sha256:0a7a8e91c62e8188f450d9ca6982bc42960c4ab7bacd8c89439e84d6bce5c100","observation_id":"e8752eaf-f1cd-4a84-a51a-3e6362f50940","resolution":{"observed_at":"2026-08-08T20:29:44.422444Z","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-08T20:29:44.425690Z","title":"Topology and data,","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2502.05063","last_updated":"2025-02-07T16:35:06Z","snapshot_observed_at":"2026-08-09T01:26:15.755794Z","submitted_at":"2025-02-07T16:35:06Z","title":"Computing and Learning on Combinatorial Data","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-08T20:29:44.425690Z"},"links":{"citing_paper":"/paper/2502.05063"},"observation_digest":"sha256:6b0cd8293ec81f6c91317c6596add7dfcdc8c73589fc70badbee2a8fb9ea3259","observation_id":"bdfee727-32c6-40e3-b90f-16ad133e9f71","resolution":{"observed_at":"2026-08-08T20:29:44.425690Z","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-08T20:29:44.431167Z","title":"Coverage in sensor networks via persistent homology,","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2502.05063","last_updated":"2025-02-07T16:35:06Z","snapshot_observed_at":"2026-08-09T01:26:15.755794Z","submitted_at":"2025-02-07T16:35:06Z","title":"Computing and Learning on Combinatorial Data","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-08T20:29:44.431167Z"},"links":{"citing_paper":"/paper/2502.05063"},"observation_digest":"sha256:9feb2c2618a71d88f997fcad8273ae84d18d7b9a1de3597a0a31631781a962f9","observation_id":"8e3965e7-a25d-47ca-9f36-716d044eda77","resolution":{"observed_at":"2026-08-08T20:29:44.431167Z","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-08T20:29:44.434794Z","title":"A topological paradigm for hippocampal spatial map formation using persistent homology,","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2502.05063","last_updated":"2025-02-07T16:35:06Z","snapshot_observed_at":"2026-08-09T01:26:15.755794Z","submitted_at":"2025-02-07T16:35:06Z","title":"Computing and Learning on Combinatorial Data","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-08T20:29:44.434794Z"},"links":{"citing_paper":"/paper/2502.05063"},"observation_digest":"sha256:6203c75d362ce819ef943ef4519c43f6d8da57320d682cb1cef9e15d5904eda9","observation_id":"507ef6c7-4a1f-491f-b826-fdb3421676f4","resolution":{"observed_at":"2026-08-08T20:29:44.434794Z","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-08T20:29:44.438037Z","title":"Finding the homology of submanifolds with high confidence from random samples,","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2502.05063","last_updated":"2025-02-07T16:35:06Z","snapshot_observed_at":"2026-08-09T01:26:15.755794Z","submitted_at":"2025-02-07T16:35:06Z","title":"Computing and Learning on Combinatorial Data","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-08T20:29:44.438037Z"},"links":{"citing_paper":"/paper/2502.05063"},"observation_digest":"sha256:1cf10bc21700cbe7e0acef5b5653ab670cd8e9363814ee22378d29d69a72dc7e","observation_id":"e409f5a5-7816-4016-b3fc-e0ebc14f4c8c","resolution":{"observed_at":"2026-08-08T20:29:44.438037Z","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-08T20:29:44.441423Z","title":"A study on validating non-linear dimensionality reduction using persistent homology,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2502.05063","last_updated":"2025-02-07T16:35:06Z","snapshot_observed_at":"2026-08-09T01:26:15.755794Z","submitted_at":"2025-02-07T16:35:06Z","title":"Computing and Learning on Combinatorial Data","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-08T20:29:44.441423Z"},"links":{"citing_paper":"/paper/2502.05063"},"observation_digest":"sha256:65dfa9ca3f684c6425fea7cc1d7ba62aea1209b5d72bf8d9cb4b4889e53ae8e4","observation_id":"d2e86ccd-31b4-462c-9b78-bcb3cf4be462","resolution":{"observed_at":"2026-08-08T20:29:44.441423Z","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-08T20:29:44.445010Z","title":"Deep learning with topological signatures,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2502.05063","last_updated":"2025-02-07T16:35:06Z","snapshot_observed_at":"2026-08-09T01:26:15.755794Z","submitted_at":"2025-02-07T16:35:06Z","title":"Computing and Learning on Combinatorial Data","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-08T20:29:44.445010Z"},"links":{"citing_paper":"/paper/2502.05063"},"observation_digest":"sha256:eed96448a5cb635dca716d3a9192d78ddc8af09f947ceafd0eaf6281a001999d","observation_id":"a82509f2-880b-43cd-8c35-2a779eaeb6c7","resolution":{"observed_at":"2026-08-08T20:29:44.445010Z","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-08T20:29:44.447970Z","title":"A roadmap for the computation of persistent homology,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2502.05063","last_updated":"2025-02-07T16:35:06Z","snapshot_observed_at":"2026-08-09T01:26:15.755794Z","submitted_at":"2025-02-07T16:35:06Z","title":"Computing and Learning on Combinatorial Data","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-08T20:29:44.447970Z"},"links":{"citing_paper":"/paper/2502.05063"},"observation_digest":"sha256:9db0364d8146be0f505ac758a6552fccfbb8d8f555b494259a263ec8f3b47527","observation_id":"0e7d028a-458f-47a8-a512-8d8d544ea2c4","resolution":{"observed_at":"2026-08-08T20:29:44.447970Z","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-08T20:29:44.463983Z","title":"Javaplex tutorial,","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2502.05063","last_updated":"2025-02-07T16:35:06Z","snapshot_observed_at":"2026-08-09T01:26:15.755794Z","submitted_at":"2025-02-07T16:35:06Z","title":"Computing and Learning on Combinatorial Data","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-08T20:29:44.463983Z"},"links":{"citing_paper":"/paper/2502.05063"},"observation_digest":"sha256:34367aaccf1cd43954dbcb3cf1abc7ba92f1a29f2f9ce6f260f7a40eb58a6d79","observation_id":"430a99a1-985f-47e2-b988-8a98fe494ba7","resolution":{"observed_at":"2026-08-08T20:29:44.463983Z","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-08T20:29:44.497064Z","title":"Phat–persistent homology algorithms toolbox,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2502.05063","last_updated":"2025-02-07T16:35:06Z","snapshot_observed_at":"2026-08-09T01:26:15.755794Z","submitted_at":"2025-02-07T16:35:06Z","title":"Computing and Learning on Combinatorial Data","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-08T20:29:44.497064Z"},"links":{"citing_paper":"/paper/2502.05063"},"observation_digest":"sha256:55facd381be1b44a0b63a5ceec8d440f54da0550c7667a42ba1a40240df71101","observation_id":"a1f174b6-930b-49f6-affb-50780b3a6372","resolution":{"observed_at":"2026-08-08T20:29:44.497064Z","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-08T20:29:44.540814Z","title":"Morozov, Dionysus software , 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2502.05063","last_updated":"2025-02-07T16:35:06Z","snapshot_observed_at":"2026-08-09T01:26:15.755794Z","submitted_at":"2025-02-07T16:35:06Z","title":"Computing and Learning on Combinatorial Data","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-08T20:29:44.540814Z"},"links":{"citing_paper":"/paper/2502.05063"},"observation_digest":"sha256:df9e3d829862e886bdd582e9afce3c20c6da1800699c4d7d27e3ce8ef8b41c63","observation_id":"0e50355b-b8b9-4aa3-b131-20cad21a5261","resolution":{"observed_at":"2026-08-08T20:29:44.540814Z","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-08T20:29:44.566604Z","title":"Distributed computation of persistent homology,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2502.05063","last_updated":"2025-02-07T16:35:06Z","snapshot_observed_at":"2026-08-09T01:26:15.755794Z","submitted_at":"2025-02-07T16:35:06Z","title":"Computing and Learning on Combinatorial Data","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-08T20:29:44.566604Z"},"links":{"citing_paper":"/paper/2502.05063"},"observation_digest":"sha256:c26841843b8f793bda8bd4b86086f9e95e45f0525105552da95101472726b19e","observation_id":"03048f8c-fb06-48b3-8563-69678fc85c40","resolution":{"observed_at":"2026-08-08T20:29:44.566604Z","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-08T20:29:44.628517Z","title":"Bauer, Ripser: Efficient computation of vietorisrips persistence barcodes , 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2502.05063","last_updated":"2025-02-07T16:35:06Z","snapshot_observed_at":"2026-08-09T01:26:15.755794Z","submitted_at":"2025-02-07T16:35:06Z","title":"Computing and Learning on Combinatorial Data","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-08T20:29:44.628517Z"},"links":{"citing_paper":"/paper/2502.05063"},"observation_digest":"sha256:909fd1f2326bae90cc95dc0b19fad37825047270f8544c012fd6b93ae07331d2","observation_id":"c98c1025-6d95-4bde-b51f-8a4d377751ce","resolution":{"observed_at":"2026-08-08T20:29:44.628517Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1606.00199","last_updated":"2017-10-17T03:59:02Z","snapshot_observed_at":"2026-07-06T04:58:19.485784Z","submitted_at":"2016-06-01T09:59:03Z","title":"Matroid Filtrations and Computational Persistent Homology","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1606.00199","snapshot_observed_at":"2026-08-08T20:29:44.660681Z","title":"Matroid filtrations and computational persistent ho- mology,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2502.05063","last_updated":"2025-02-07T16:35:06Z","snapshot_observed_at":"2026-08-09T01:26:15.755794Z","submitted_at":"2025-02-07T16:35:06Z","title":"Computing and Learning on Combinatorial Data","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-08T20:29:44.660681Z"},"links":{"cited_paper":"/paper/1606.00199","citing_paper":"/paper/2502.05063"},"observation_digest":"sha256:02d53be28cf708727f16a4e4485b8a4859f68dbbeee73af2ac975641cc3389f0","observation_id":"bfe283b7-129a-41de-8042-6fbc3368565e","resolution":{"observed_at":"2026-08-08T20:29:44.660681Z","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-08T20:29:44.691695Z","title":"A new data structure for cumulative frequency tables,","venue":null,"work_id":null,"year":1994},"citing_paper":{"arxiv_id":"2502.05063","last_updated":"2025-02-07T16:35:06Z","snapshot_observed_at":"2026-08-09T01:26:15.755794Z","submitted_at":"2025-02-07T16:35:06Z","title":"Computing and Learning on Combinatorial Data","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-08T20:29:44.691695Z"},"links":{"citing_paper":"/paper/2502.05063"},"observation_digest":"sha256:fcaf97a7dbdaf495650c4bd7bc3c9b041ed9e33496b06a2a7a01fe1d6ecccadd","observation_id":"191d510d-76c2-4c0b-8989-2b18d01d58ee","resolution":{"observed_at":"2026-08-08T20:29:44.691695Z","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-08T20:29:44.731679Z","title":"Cramming more components onto integrated circuits,","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2502.05063","last_updated":"2025-02-07T16:35:06Z","snapshot_observed_at":"2026-08-09T01:26:15.755794Z","submitted_at":"2025-02-07T16:35:06Z","title":"Computing and Learning on Combinatorial Data","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-08T20:29:44.731679Z"},"links":{"citing_paper":"/paper/2502.05063"},"observation_digest":"sha256:9ac96deaecd35d4c0d997451708597019206c6f6d5947eee5f89b0830fb85600","observation_id":"ae6847fb-707c-456e-b03c-c6f32e2d0b48","resolution":{"observed_at":"2026-08-08T20:29:44.731679Z","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-08T20:29:44.734988Z","title":"Design of ion-implanted mosfet’s with very small physical dimensions,","venue":null,"work_id":null,"year":1974},"citing_paper":{"arxiv_id":"2502.05063","last_updated":"2025-02-07T16:35:06Z","snapshot_observed_at":"2026-08-09T01:26:15.755794Z","submitted_at":"2025-02-07T16:35:06Z","title":"Computing and Learning on Combinatorial Data","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-08T20:29:44.734988Z"},"links":{"citing_paper":"/paper/2502.05063"},"observation_digest":"sha256:15c7f658c5ea4d4a180617d102129f20e0c79e7bb4cf3a3cfc02461b5d8198cc","observation_id":"4de52e2d-5a37-4e25-933c-7b191d27b663","resolution":{"observed_at":"2026-08-08T20:29:44.734988Z","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-08T20:29:44.739066Z","title":"Edelsbrunner and J","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2502.05063","last_updated":"2025-02-07T16:35:06Z","snapshot_observed_at":"2026-08-09T01:26:15.755794Z","submitted_at":"2025-02-07T16:35:06Z","title":"Computing and Learning on Combinatorial Data","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-08T20:29:44.739066Z"},"links":{"citing_paper":"/paper/2502.05063"},"observation_digest":"sha256:7b66e2cdca57758ad96346cab213ff574344668d5a22ca32814afd8a92e12525","observation_id":"285c4b8a-5b27-4c70-9455-64ac823a1e21","resolution":{"observed_at":"2026-08-08T20:29:44.739066Z","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-08T20:29:44.742774Z","title":"Clear and compress: Computing persistent homology in chunks,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2502.05063","last_updated":"2025-02-07T16:35:06Z","snapshot_observed_at":"2026-08-09T01:26:15.755794Z","submitted_at":"2025-02-07T16:35:06Z","title":"Computing and Learning on Combinatorial Data","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-08T20:29:44.742774Z"},"links":{"citing_paper":"/paper/2502.05063"},"observation_digest":"sha256:d0aa4bcf53f706d33695224203f32c168bbf38351b06b046e5fde19ad1ab45bf","observation_id":"aaceb2dd-e849-491e-9810-065922770b62","resolution":{"observed_at":"2026-08-08T20:29:44.742774Z","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-08T20:29:44.745822Z","title":"Persistent homology computation with a twist,","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2502.05063","last_updated":"2025-02-07T16:35:06Z","snapshot_observed_at":"2026-08-09T01:26:15.755794Z","submitted_at":"2025-02-07T16:35:06Z","title":"Computing and Learning on Combinatorial Data","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-08T20:29:44.745822Z"},"links":{"citing_paper":"/paper/2502.05063"},"observation_digest":"sha256:05e2c993f56cb1df00304b13a0237c469a85511a463c9bb0446419fce95f2f68","observation_id":"9b46ef4e-5706-484c-af1d-4b5340e10e76","resolution":{"observed_at":"2026-08-08T20:29:44.745822Z","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-08T20:29:44.749675Z","title":"Vines and vineyards by updat- ing persistence in linear time,","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2502.05063","last_updated":"2025-02-07T16:35:06Z","snapshot_observed_at":"2026-08-09T01:26:15.755794Z","submitted_at":"2025-02-07T16:35:06Z","title":"Computing and Learning on Combinatorial Data","version":1},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-08T20:29:44.749675Z"},"links":{"citing_paper":"/paper/2502.05063"},"observation_digest":"sha256:baf37178d6f246ddb28efacb0ae405a7ac0fbe03b3b7a8229cd958a32e723a45","observation_id":"d4ec9fc1-1e5a-41ca-b50b-77cbc7b09d6f","resolution":{"observed_at":"2026-08-08T20:29:44.749675Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1708.04710","last_updated":"2017-08-15T22:47:44Z","snapshot_observed_at":"2026-07-06T05:55:27.598127Z","submitted_at":"2017-08-15T22:47:44Z","title":"Parallel multi-scale reduction of persistent homology filtrations","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1708.04710","snapshot_observed_at":"2026-08-08T20:29:44.753598Z","title":"Parallel multi-scale reduction of persistent ho- mology filtrations,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2502.05063","last_updated":"2025-02-07T16:35:06Z","snapshot_observed_at":"2026-08-09T01:26:15.755794Z","submitted_at":"2025-02-07T16:35:06Z","title":"Computing and Learning on Combinatorial Data","version":1},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-08T20:29:44.753598Z"},"links":{"cited_paper":"/paper/1708.04710","citing_paper":"/paper/2502.05063"},"observation_digest":"sha256:c86c6f38e6b3cdea9038ac462f0e017ca58605fe548b7b8e7cb2e323b7966561","observation_id":"c2d5109b-aa9d-4169-945a-0ac9684a3bd1","resolution":{"observed_at":"2026-08-08T20:29:44.753598Z","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-08T20:29:44.758142Z","title":null,"venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2502.05063","last_updated":"2025-02-07T16:35:06Z","snapshot_observed_at":"2026-08-09T01:26:15.755794Z","submitted_at":"2025-02-07T16:35:06Z","title":"Computing and Learning on Combinatorial Data","version":1},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-08-08T20:29:44.758142Z"},"links":{"citing_paper":"/paper/2502.05063"},"observation_digest":"sha256:3268052408ba4fa849b61944aad48148013fb7f295944549a40052cb0eb1ce27","observation_id":"7df251f7-ce4b-4cb7-81d3-2848231c4cc0","resolution":{"observed_at":"2026-08-08T20:29:44.758142Z","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-08T20:29:44.761709Z","title":"The nonlinear statistics of high-contrast patches in natural images,","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2502.05063","last_updated":"2025-02-07T16:35:06Z","snapshot_observed_at":"2026-08-09T01:26:15.755794Z","submitted_at":"2025-02-07T16:35:06Z","title":"Computing and Learning on Combinatorial Data","version":1},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-08-08T20:29:44.761709Z"},"links":{"citing_paper":"/paper/2502.05063"},"observation_digest":"sha256:068b0c9614cf37a13b6105b55bfc03a515b6cf2e69d5ba0962716a3bc14ca538","observation_id":"e8550bd1-44d8-4c29-b28b-65b32f1b1835","resolution":{"observed_at":"2026-08-08T20:29:44.761709Z","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-08T20:29:44.765583Z","title":"Introduction to alpha shapes,","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2502.05063","last_updated":"2025-02-07T16:35:06Z","snapshot_observed_at":"2026-08-09T01:26:15.755794Z","submitted_at":"2025-02-07T16:35:06Z","title":"Computing and Learning on Combinatorial Data","version":1},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-08-08T20:29:44.765583Z"},"links":{"citing_paper":"/paper/2502.05063"},"observation_digest":"sha256:e7eaab2272410831f9af6f4eade229647031c30b93f55591849c219b287b6018","observation_id":"bc109e88-cc55-46bc-bbd7-bac1a8fb0b0b","resolution":{"observed_at":"2026-08-08T20:29:44.765583Z","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-08T20:29:44.769022Z","title":"Loops skewing: The wavefront method revisited,","venue":null,"work_id":null,"year":1986},"citing_paper":{"arxiv_id":"2502.05063","last_updated":"2025-02-07T16:35:06Z","snapshot_observed_at":"2026-08-09T01:26:15.755794Z","submitted_at":"2025-02-07T16:35:06Z","title":"Computing and Learning on Combinatorial Data","version":1},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-08-08T20:29:44.769022Z"},"links":{"citing_paper":"/paper/2502.05063"},"observation_digest":"sha256:ce3c7ab8f5dbee65c628cba5e7d231e4f7947351f081b33028760299aa834f15","observation_id":"44910a85-9d37-468a-add1-aa0476c3121a","resolution":{"observed_at":"2026-08-08T20:29:44.769022Z","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":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:29:49.605990Z","title":"Peerwave: Exploiting wavefront parallelism on gpus with peer-sm synchronization,","venue":null,"work_id":"7a8723d7-cc55-4c9c-b22e-093c9d0496c5","year":2015},"citing_paper":{"arxiv_id":"2502.05063","last_updated":"2025-02-07T16:35:06Z","snapshot_observed_at":"2026-08-09T01:26:15.755794Z","submitted_at":"2025-02-07T16:35:06Z","title":"Computing and Learning on Combinatorial Data","version":1},"reference_index":76,"source":"pdf_text","source_observed_at":"2026-08-08T20:29:44.772348Z"},"links":{"citing_paper":"/paper/2502.05063"},"observation_digest":"sha256:1d553396136601bece285897d98d62f33a6bf503d2182bbc0c3574b56c245f47","observation_id":"7b543a67-6f3c-47bb-ba86-2536c9caa187","resolution":{"observed_at":"2026-08-08T20:29:49.609871Z","resolver_source":"arxiv_id_nonexistent","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T20:29:44.781604Z","title":"Highly efficient compensation- based parallelism for wavefront loops on gpus,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2502.05063","last_updated":"2025-02-07T16:35:06Z","snapshot_observed_at":"2026-08-09T01:26:15.755794Z","submitted_at":"2025-02-07T16:35:06Z","title":"Computing and Learning on Combinatorial Data","version":1},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-08-08T20:29:44.781604Z"},"links":{"citing_paper":"/paper/2502.05063"},"observation_digest":"sha256:b31791e075e92b2fe00e7208e8e9741db36645a417d7dd83d59f88a24aa6b911","observation_id":"0b8762b3-a7fd-45a3-b0b6-8359111dfa66","resolution":{"observed_at":"2026-08-08T20:29:44.781604Z","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-08T20:29:44.785977Z","title":"The pareto, zipf and other power laws,","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2502.05063","last_updated":"2025-02-07T16:35:06Z","snapshot_observed_at":"2026-08-09T01:26:15.755794Z","submitted_at":"2025-02-07T16:35:06Z","title":"Computing and Learning on Combinatorial Data","version":1},"reference_index":78,"source":"pdf_text","source_observed_at":"2026-08-08T20:29:44.785977Z"},"links":{"citing_paper":"/paper/2502.05063"},"observation_digest":"sha256:c96bb5bc7370cc9ba40da37e58b8cba992d46bb3c1eaf73d1e0472711ffeee4c","observation_id":"ad8909d6-14eb-4f49-b33b-61854fb7714b","resolution":{"observed_at":"2026-08-08T20:29:44.785977Z","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-08T20:29:44.789490Z","title":"The tail at scale,","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2502.05063","last_updated":"2025-02-07T16:35:06Z","snapshot_observed_at":"2026-08-09T01:26:15.755794Z","submitted_at":"2025-02-07T16:35:06Z","title":"Computing and Learning on Combinatorial Data","version":1},"reference_index":79,"source":"pdf_text","source_observed_at":"2026-08-08T20:29:44.789490Z"},"links":{"citing_paper":"/paper/2502.05063"},"observation_digest":"sha256:d3e6f07522805ccc23160bba40bd583bd1139860200960696d7e787b51100168","observation_id":"49351d96-674e-48f7-8b52-78f4fe92de4d","resolution":{"observed_at":"2026-08-08T20:29:44.789490Z","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-08T20:29:44.792879Z","title":"Fibonacci heaps and their uses in improved network optimization algorithms,","venue":null,"work_id":null,"year":1987},"citing_paper":{"arxiv_id":"2502.05063","last_updated":"2025-02-07T16:35:06Z","snapshot_observed_at":"2026-08-09T01:26:15.755794Z","submitted_at":"2025-02-07T16:35:06Z","title":"Computing and Learning on Combinatorial Data","version":1},"reference_index":80,"source":"pdf_text","source_observed_at":"2026-08-08T20:29:44.792879Z"},"links":{"citing_paper":"/paper/2502.05063"},"observation_digest":"sha256:8d99d7075cf02941255ee34cb264e6e8a271678ee92e540fc2f348c1df35de58","observation_id":"88a8abae-a5ed-432f-bd26-f0bd97c03e58","resolution":{"observed_at":"2026-08-08T20:29:44.792879Z","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-08T20:29:44.800504Z","title":"The yin and yang of processing data warehousing queries on gpu devices,","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2502.05063","last_updated":"2025-02-07T16:35:06Z","snapshot_observed_at":"2026-08-09T01:26:15.755794Z","submitted_at":"2025-02-07T16:35:06Z","title":"Computing and Learning on Combinatorial Data","version":1},"reference_index":81,"source":"pdf_text","source_observed_at":"2026-08-08T20:29:44.800504Z"},"links":{"citing_paper":"/paper/2502.05063"},"observation_digest":"sha256:37f7e78aa9117bd55b272ea80b635c949013b674991e1594f963368fd3850d62","observation_id":"4f6f3faa-6838-4a15-9abb-1af4ddce3de8","resolution":{"observed_at":"2026-08-08T20:29:44.800504Z","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-08T20:29:44.803978Z","title":"Persistent cohomology and circular coordinates,","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2502.05063","last_updated":"2025-02-07T16:35:06Z","snapshot_observed_at":"2026-08-09T01:26:15.755794Z","submitted_at":"2025-02-07T16:35:06Z","title":"Computing and Learning on Combinatorial Data","version":1},"reference_index":82,"source":"pdf_text","source_observed_at":"2026-08-08T20:29:44.803978Z"},"links":{"citing_paper":"/paper/2502.05063"},"observation_digest":"sha256:d81ba50011257058bc597bf4f552f76c5c2302e56d5c7745fef67bbde1d32fbd","observation_id":"469ea22c-a256-4b57-8138-8249565def1f","resolution":{"observed_at":"2026-08-08T20:29:44.803978Z","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-08T20:29:44.807748Z","title":"Dualities in persistent (co) homology,","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2502.05063","last_updated":"2025-02-07T16:35:06Z","snapshot_observed_at":"2026-08-09T01:26:15.755794Z","submitted_at":"2025-02-07T16:35:06Z","title":"Computing and Learning on Combinatorial Data","version":1},"reference_index":83,"source":"pdf_text","source_observed_at":"2026-08-08T20:29:44.807748Z"},"links":{"citing_paper":"/paper/2502.05063"},"observation_digest":"sha256:d2e3abe559f4e6b50546706ead2d46ea52a1d9597499227d998496dc0fec0911","observation_id":"03951ea3-35dc-41e6-afa9-1e5242e03a84","resolution":{"observed_at":"2026-08-08T20:29:44.807748Z","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-08T20:29:44.811210Z","title":"Austria, Phat (persistent homology algorithm toolbox), v1.5 , 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2502.05063","last_updated":"2025-02-07T16:35:06Z","snapshot_observed_at":"2026-08-09T01:26:15.755794Z","submitted_at":"2025-02-07T16:35:06Z","title":"Computing and Learning on Combinatorial Data","version":1},"reference_index":84,"source":"pdf_text","source_observed_at":"2026-08-08T20:29:44.811210Z"},"links":{"citing_paper":"/paper/2502.05063"},"observation_digest":"sha256:5c6127a351f598a41ce84c49dd394f1c389f8b0eae6a7044794b4886f8c503b5","observation_id":"55a74a36-7309-47c6-8460-d254dd4b804c","resolution":{"observed_at":"2026-08-08T20:29:44.811210Z","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-08T20:29:44.814521Z","title":"Custinger: Supporting dynamic graph algorithms for gpus,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2502.05063","last_updated":"2025-02-07T16:35:06Z","snapshot_observed_at":"2026-08-09T01:26:15.755794Z","submitted_at":"2025-02-07T16:35:06Z","title":"Computing and Learning on Combinatorial Data","version":1},"reference_index":85,"source":"pdf_text","source_observed_at":"2026-08-08T20:29:44.814521Z"},"links":{"citing_paper":"/paper/2502.05063"},"observation_digest":"sha256:13a05672cfb93f839a859ca1151244a143cf688f4ea8e749b6404ddc4543c9e9","observation_id":"58dec32f-070c-4ac9-aef4-32d75b12e6b8","resolution":{"observed_at":"2026-08-08T20:29:44.814521Z","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-08T20:29:44.817576Z","title":"Accelerating dynamic graph analytics on gpus,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2502.05063","last_updated":"2025-02-07T16:35:06Z","snapshot_observed_at":"2026-08-09T01:26:15.755794Z","submitted_at":"2025-02-07T16:35:06Z","title":"Computing and Learning on Combinatorial Data","version":1},"reference_index":86,"source":"pdf_text","source_observed_at":"2026-08-08T20:29:44.817576Z"},"links":{"citing_paper":"/paper/2502.05063"},"observation_digest":"sha256:845fc4ea788d36abe301834bd2855734417bc383c02d7f983ddac90564c96dd3","observation_id":"c3ef03c2-cb3b-4f88-b685-b1f000f686f6","resolution":{"observed_at":"2026-08-08T20:29:44.817576Z","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-08T20:29:44.820974Z","title":"Hornet: An efficient data struc- ture for dynamic sparse graphs and matrices on gpus,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2502.05063","last_updated":"2025-02-07T16:35:06Z","snapshot_observed_at":"2026-08-09T01:26:15.755794Z","submitted_at":"2025-02-07T16:35:06Z","title":"Computing and Learning on Combinatorial Data","version":1},"reference_index":87,"source":"pdf_text","source_observed_at":"2026-08-08T20:29:44.820974Z"},"links":{"citing_paper":"/paper/2502.05063"},"observation_digest":"sha256:31afc3669436ec1de4c8df19d288b633a7d2d52631dbf70ec9aba1703c54a333","observation_id":"313ee109-faa3-4836-8a43-80dce296f88e","resolution":{"observed_at":"2026-08-08T20:29:44.820974Z","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-08T20:29:44.824027Z","title":"Faimgraph: High performance management of fully-dynamic graphs under tight memory constraints on the gpu,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2502.05063","last_updated":"2025-02-07T16:35:06Z","snapshot_observed_at":"2026-08-09T01:26:15.755794Z","submitted_at":"2025-02-07T16:35:06Z","title":"Computing and Learning on Combinatorial Data","version":1},"reference_index":88,"source":"pdf_text","source_observed_at":"2026-08-08T20:29:44.824027Z"},"links":{"citing_paper":"/paper/2502.05063"},"observation_digest":"sha256:d6fa6e3fa564eaea19f162eae19d59d41fad4b82b18fd530093b4c0fd545f6be","observation_id":"58294734-1bbd-44f3-96a8-e44e3485c1dc","resolution":{"observed_at":"2026-08-08T20:29:44.824027Z","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-08T20:29:44.827073Z","title":"Performance enhance- ment of a computational persistent homology package,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2502.05063","last_updated":"2025-02-07T16:35:06Z","snapshot_observed_at":"2026-08-09T01:26:15.755794Z","submitted_at":"2025-02-07T16:35:06Z","title":"Computing and Learning on Combinatorial Data","version":1},"reference_index":89,"source":"pdf_text","source_observed_at":"2026-08-08T20:29:44.827073Z"},"links":{"citing_paper":"/paper/2502.05063"},"observation_digest":"sha256:c64b91557ce4345e9f804115df4a3000f1d2fb4036f181d79862ff6669eefaae","observation_id":"2203dd44-f7b4-4de9-ad4e-35e86832483c","resolution":{"observed_at":"2026-08-08T20:29:44.827073Z","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-08T20:29:44.829891Z","title":"Morse theory for filtrations and efficient computation of persistent homology,","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2502.05063","last_updated":"2025-02-07T16:35:06Z","snapshot_observed_at":"2026-08-09T01:26:15.755794Z","submitted_at":"2025-02-07T16:35:06Z","title":"Computing and Learning on Combinatorial Data","version":1},"reference_index":90,"source":"pdf_text","source_observed_at":"2026-08-08T20:29:44.829891Z"},"links":{"citing_paper":"/paper/2502.05063"},"observation_digest":"sha256:3a241e70428771c84cb465633a7d759ce29b5984321216ccf52ea3ba46c640f5","observation_id":"cb18699a-8ec6-40ad-904b-1c6d13115060","resolution":{"observed_at":"2026-08-08T20:29:44.829891Z","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-08T20:29:44.832959Z","title":"GUDHI Editorial Board,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.05063","last_updated":"2025-02-07T16:35:06Z","snapshot_observed_at":"2026-08-09T01:26:15.755794Z","submitted_at":"2025-02-07T16:35:06Z","title":"Computing and Learning on Combinatorial Data","version":1},"reference_index":91,"source":"pdf_text","source_observed_at":"2026-08-08T20:29:44.832959Z"},"links":{"citing_paper":"/paper/2502.05063"},"observation_digest":"sha256:45cdaa67ab4caed5db48b96121a8604a29572c9d15a09bd47d1bc8a1c9b91754","observation_id":"c4524bf6-bb41-47d9-a2e1-4dc6397b9d74","resolution":{"observed_at":"2026-08-08T20:29:44.832959Z","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-08T20:29:44.839760Z","title":"The compressed annotation matrix: An efficient data structure for computing persistent cohomology,","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2502.05063","last_updated":"2025-02-07T16:35:06Z","snapshot_observed_at":"2026-08-09T01:26:15.755794Z","submitted_at":"2025-02-07T16:35:06Z","title":"Computing and Learning on Combinatorial Data","version":1},"reference_index":92,"source":"pdf_text","source_observed_at":"2026-08-08T20:29:44.839760Z"},"links":{"citing_paper":"/paper/2502.05063"},"observation_digest":"sha256:257627867e1063e63107146abb92a5d558e2b863ae1223583cdbbc19c3173085","observation_id":"a5c02260-2023-4eaf-8908-e0d86a40c3dd","resolution":{"observed_at":"2026-08-08T20:29:44.839760Z","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-08T20:29:44.842676Z","title":"Computing topological persistence for simplicial maps,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2502.05063","last_updated":"2025-02-07T16:35:06Z","snapshot_observed_at":"2026-08-09T01:26:15.755794Z","submitted_at":"2025-02-07T16:35:06Z","title":"Computing and Learning on Combinatorial Data","version":1},"reference_index":93,"source":"pdf_text","source_observed_at":"2026-08-08T20:29:44.842676Z"},"links":{"citing_paper":"/paper/2502.05063"},"observation_digest":"sha256:01619487b76ba0f74ab2868a7269d5a02fa55f453085c138d9f79dd8888b0896","observation_id":"93774ef9-99f4-42f5-b752-909dea89c0a7","resolution":{"observed_at":"2026-08-08T20:29:44.842676Z","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-08T20:29:44.845990Z","title":"Accelerating pathol- ogy image data cross-comparison on cpu-gpu hybrid systems,","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2502.05063","last_updated":"2025-02-07T16:35:06Z","snapshot_observed_at":"2026-08-09T01:26:15.755794Z","submitted_at":"2025-02-07T16:35:06Z","title":"Computing and Learning on Combinatorial Data","version":1},"reference_index":94,"source":"pdf_text","source_observed_at":"2026-08-08T20:29:44.845990Z"},"links":{"citing_paper":"/paper/2502.05063"},"observation_digest":"sha256:a8db6b580b577eb9611b78cd3f11460035f15b70d391bd76336a2ef65f07baf6","observation_id":"05abcd5c-7d17-4ec8-bdb1-ce907db0636b","resolution":{"observed_at":"2026-08-08T20:29:44.845990Z","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-08T20:29:44.856404Z","title":"Throughput-oriented gpu memory allocation,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2502.05063","last_updated":"2025-02-07T16:35:06Z","snapshot_observed_at":"2026-08-09T01:26:15.755794Z","submitted_at":"2025-02-07T16:35:06Z","title":"Computing and Learning on Combinatorial Data","version":1},"reference_index":95,"source":"pdf_text","source_observed_at":"2026-08-08T20:29:44.856404Z"},"links":{"citing_paper":"/paper/2502.05063"},"observation_digest":"sha256:8f7e932b814850b64ad24e48c239a1e652b3c606129b2d5574114ec8d76b67bc","observation_id":"ec1ff595-c5a2-4c49-8db0-e88fd954cea6","resolution":{"observed_at":"2026-08-08T20:29:44.856404Z","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-08T20:29:44.887553Z","title":"Mega-kv: A case for gpus to maximize the throughput of in-memory key-value stores,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2502.05063","last_updated":"2025-02-07T16:35:06Z","snapshot_observed_at":"2026-08-09T01:26:15.755794Z","submitted_at":"2025-02-07T16:35:06Z","title":"Computing and Learning on Combinatorial Data","version":1},"reference_index":96,"source":"pdf_text","source_observed_at":"2026-08-08T20:29:44.887553Z"},"links":{"citing_paper":"/paper/2502.05063"},"observation_digest":"sha256:ade683ac46140df0447695357a9b6a683122b4e959d634702bc31de4a9bd40e3","observation_id":"5039a8f9-7a9e-48cf-94aa-796285b401f3","resolution":{"observed_at":"2026-08-08T20:29:44.887553Z","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-08T20:29:44.963801Z","title":"Persistence homology of networks: Methods and applications,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2502.05063","last_updated":"2025-02-07T16:35:06Z","snapshot_observed_at":"2026-08-09T01:26:15.755794Z","submitted_at":"2025-02-07T16:35:06Z","title":"Computing and Learning on Combinatorial Data","version":1},"reference_index":97,"source":"pdf_text","source_observed_at":"2026-08-08T20:29:44.963801Z"},"links":{"citing_paper":"/paper/2502.05063"},"observation_digest":"sha256:34608b63957df6330587529c46dd896ed6563c42d896daecd3399be52d2850a2","observation_id":"95bddb25-c9c4-400c-9b9d-2d135c7eca2f","resolution":{"observed_at":"2026-08-08T20:29:44.963801Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1906.10458","last_updated":"2019-06-25T11:21:39Z","snapshot_observed_at":"2026-07-06T08:02:39.304615Z","submitted_at":"2019-06-25T11:21:39Z","title":"Computing persistent homology of directed flag complexes","version":1},"cited_work":{"arxiv_id":"1906.10458","doi":null,"metadata_source":"pith","pith_arxiv_id":"1906.10458","snapshot_observed_at":"2026-08-08T20:29:49.149831Z","title":"Computing persistent homology of directed flag complexes","venue":"math.AT","work_id":"6fe9d338-4f23-4395-89e6-373eb344b375","year":2019},"citing_paper":{"arxiv_id":"2502.05063","last_updated":"2025-02-07T16:35:06Z","snapshot_observed_at":"2026-08-09T01:26:15.755794Z","submitted_at":"2025-02-07T16:35:06Z","title":"Computing and Learning on Combinatorial Data","version":1},"reference_index":98,"source":"pdf_text","source_observed_at":"2026-08-08T20:29:44.987304Z"},"links":{"cited_paper":"/paper/1906.10458","citing_paper":"/paper/2502.05063"},"observation_digest":"sha256:30fd913e4d68dfeb9e509cddf64396c31dfed868c4b03b06c67dee9adad7f0ee","observation_id":"2882c22b-e47d-4e23-979b-8560770f846d","resolution":{"observed_at":"2026-08-08T20:29:49.167677Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1601.05794","last_updated":"2016-01-21T07:07:21Z","snapshot_observed_at":"2026-07-06T04:43:39.436074Z","submitted_at":"2016-01-21T07:07:21Z","title":"Proof of bijection for combinatorial number system","version":1},"cited_work":{"arxiv_id":"1601.05794","doi":null,"metadata_source":"pith","pith_arxiv_id":"1601.05794","snapshot_observed_at":"2026-08-08T20:29:49.109908Z","title":"Proof of bijection for combinatorial number system","venue":"math.CO","work_id":"a423cf4d-d11f-4040-b353-abdd319330ee","year":2016},"citing_paper":{"arxiv_id":"2502.05063","last_updated":"2025-02-07T16:35:06Z","snapshot_observed_at":"2026-08-09T01:26:15.755794Z","submitted_at":"2025-02-07T16:35:06Z","title":"Computing and Learning on Combinatorial Data","version":1},"reference_index":99,"source":"pdf_text","source_observed_at":"2026-08-08T20:29:45.030249Z"},"links":{"cited_paper":"/paper/1601.05794","citing_paper":"/paper/2502.05063"},"observation_digest":"sha256:07fe2e411cfc7470a36a71aba681377d4e20968a447421ee0e435b25ae3c3bbb","observation_id":"470d1b77-f934-4092-a78d-dee517f1b766","resolution":{"observed_at":"2026-08-08T20:29:49.117506Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T20:29:45.087026Z","title":null,"venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2502.05063","last_updated":"2025-02-07T16:35:06Z","snapshot_observed_at":"2026-08-09T01:26:15.755794Z","submitted_at":"2025-02-07T16:35:06Z","title":"Computing and Learning on Combinatorial Data","version":1},"reference_index":100,"source":"pdf_text","source_observed_at":"2026-08-08T20:29:45.087026Z"},"links":{"citing_paper":"/paper/2502.05063"},"observation_digest":"sha256:98718cde1d24c9f4caa2a0b39d52089b0c60f34525dbe52c76c0b65a46a91b1d","observation_id":"75e0a908-e2d0-44f0-ba09-9ef143f7f182","resolution":{"observed_at":"2026-08-08T20:29:45.087026Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2502.05063","last_updated":"2025-02-07T16:35:06Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-09T01:26:15.755794Z","submitted_at":"2025-02-07T16:35:06Z","title":"Computing and Learning on Combinatorial Data"},"reference_resolution":{"displayed":100,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":96,"verified_exact":3,"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 100 of 300 outbound references and 0 inbound Pith citation observations for arXiv:2502.05063."}