{"as_of":"2026-08-14T00:46:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:560e32e3125f68cdea2aef42deabf62bfdfefc3ba505af239bf91318098e9349","coverage":[{"denominator":44,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":44,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-02T22:21:45.652982Z","state":"measured"},{"denominator":44,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":44,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+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/2602.17834/citation-record","integrity":"/paper/2602.17834/integrity","json":"/paper/2602.17834/citation-record.json","paper":"/paper/2602.17834"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T22:21:41.644529Z","title":"Distributed coloring of hypergraphs","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2602.17834","last_updated":"2026-06-05T15:55:35Z","snapshot_observed_at":"2026-08-05T10:58:00.325683Z","submitted_at":"2026-02-19T20:57:26Z","title":"Distributed Triangle and Simplex Enumeration in Hypergraphs","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-02T22:21:41.644529Z"},"links":{"citing_paper":"/paper/2602.17834"},"observation_digest":"sha256:873747ebcb5c10fc9b467de3e832ed825b9d5fa2b7ca22080bc18213fc93b35a","observation_id":"ac6ee56d-7219-4497-8afb-27dd7020bc32","resolution":{"observed_at":"2026-08-02T22:21:41.644529Z","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-02T22:21:41.719124Z","title":"Distributed weak independent sets in hypergraphs: Upper and lower bounds","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.17834","last_updated":"2026-06-05T15:55:35Z","snapshot_observed_at":"2026-08-05T10:58:00.325683Z","submitted_at":"2026-02-19T20:57:26Z","title":"Distributed Triangle and Simplex Enumeration in Hypergraphs","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-02T22:21:41.719124Z"},"links":{"citing_paper":"/paper/2602.17834"},"observation_digest":"sha256:b23448d908cac67f850d9fc84f1a0b06f4ea4a2f1547a73aed37e0044341eb16","observation_id":"349e55fa-e15a-4641-9967-372af59c0f6f","resolution":{"observed_at":"2026-08-02T22:21:41.719124Z","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-02T22:21:41.824206Z","title":"A Survey on Hypergraph Representation Learning","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.17834","last_updated":"2026-06-05T15:55:35Z","snapshot_observed_at":"2026-08-05T10:58:00.325683Z","submitted_at":"2026-02-19T20:57:26Z","title":"Distributed Triangle and Simplex Enumeration in Hypergraphs","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-02T22:21:41.824206Z"},"links":{"citing_paper":"/paper/2602.17834"},"observation_digest":"sha256:63900be7e1831e1ca3228d78a99a641907b3f99c8575837673e8ccf26a23cccc","observation_id":"06f7a502-3091-4b30-996b-95b97a80fb2d","resolution":{"observed_at":"2026-08-02T22:21:41.824206Z","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-02T22:21:41.897960Z","title":"The Internet of Things: A Survey","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2602.17834","last_updated":"2026-06-05T15:55:35Z","snapshot_observed_at":"2026-08-05T10:58:00.325683Z","submitted_at":"2026-02-19T20:57:26Z","title":"Distributed Triangle and Simplex Enumeration in Hypergraphs","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-02T22:21:41.897960Z"},"links":{"citing_paper":"/paper/2602.17834"},"observation_digest":"sha256:00994a0e6ef60943e5641a470e7617d4218140e4a2eaa33d5a70a4b79446c305","observation_id":"e0c6d275-d46f-4eac-ae89-0b4ffab47e00","resolution":{"observed_at":"2026-08-02T22:21:41.897960Z","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-02T22:21:41.965559Z","title":"A Trade-off between Information and Communication in Broadcast Protocols","venue":null,"work_id":null,"year":1990},"citing_paper":{"arxiv_id":"2602.17834","last_updated":"2026-06-05T15:55:35Z","snapshot_observed_at":"2026-08-05T10:58:00.325683Z","submitted_at":"2026-02-19T20:57:26Z","title":"Distributed Triangle and Simplex Enumeration in Hypergraphs","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-02T22:21:41.965559Z"},"links":{"citing_paper":"/paper/2602.17834"},"observation_digest":"sha256:8a1db7eb6b904cf8d922c3df180d066725ed9662ec339f2bb00c70d7ac371b8c","observation_id":"a063e823-e6fb-43ba-9dc5-fcf61be1b60b","resolution":{"observed_at":"2026-08-02T22:21:41.965559Z","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-02T22:21:42.033469Z","title":"Distributed Maximal Matching and Maximal Independent Set on Hypergraphs","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2602.17834","last_updated":"2026-06-05T15:55:35Z","snapshot_observed_at":"2026-08-05T10:58:00.325683Z","submitted_at":"2026-02-19T20:57:26Z","title":"Distributed Triangle and Simplex Enumeration in Hypergraphs","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-02T22:21:42.033469Z"},"links":{"citing_paper":"/paper/2602.17834"},"observation_digest":"sha256:cf75fe84878e9aeba9dbd038ff69ab9b5ee220b4764eefe7c5b2f10ba5ff67d9","observation_id":"b9f9cc02-0620-4976-a18f-15204aaf99fd","resolution":{"observed_at":"2026-08-02T22:21:42.033469Z","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-02T22:21:42.138905Z","title":"Distributed Graph Coloring: Fundamentals and Re- cent Developments","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2602.17834","last_updated":"2026-06-05T15:55:35Z","snapshot_observed_at":"2026-08-05T10:58:00.325683Z","submitted_at":"2026-02-19T20:57:26Z","title":"Distributed Triangle and Simplex Enumeration in Hypergraphs","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-02T22:21:42.138905Z"},"links":{"citing_paper":"/paper/2602.17834"},"observation_digest":"sha256:71d6c2788d5a5e3dfadcb380d29ff37437314bd60ab2d0ebfcb11e42fbb0a20b","observation_id":"80e1129c-e82b-438b-b0cf-401452dec81f","resolution":{"observed_at":"2026-08-02T22:21:42.138905Z","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-02T22:21:42.287244Z","title":"Sublogarithmic Distributed MIS Algorithm for Sparse Graphs Using Nash-Williams Decomposition","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2602.17834","last_updated":"2026-06-05T15:55:35Z","snapshot_observed_at":"2026-08-05T10:58:00.325683Z","submitted_at":"2026-02-19T20:57:26Z","title":"Distributed Triangle and Simplex Enumeration in Hypergraphs","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-02T22:21:42.287244Z"},"links":{"citing_paper":"/paper/2602.17834"},"observation_digest":"sha256:fe1fb5a627a3dacb961d26ac7fd5bef4a1562ab50baa5b829b6e938db0c68884","observation_id":"fa80a860-3e91-449f-bd49-6e0a7762898f","resolution":{"observed_at":"2026-08-02T22:21:42.287244Z","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-02T22:21:42.358283Z","title":"Networks beyond Pairwise Interactions: Structure and Dynamics","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2602.17834","last_updated":"2026-06-05T15:55:35Z","snapshot_observed_at":"2026-08-05T10:58:00.325683Z","submitted_at":"2026-02-19T20:57:26Z","title":"Distributed Triangle and Simplex Enumeration in Hypergraphs","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-02T22:21:42.358283Z"},"links":{"citing_paper":"/paper/2602.17834"},"observation_digest":"sha256:78ef7ad052d6b1a3a12a88b39ed61940226ee7157e16cc49e8baef9a26b44c9e","observation_id":"4aa58cc2-264f-4787-89cd-9a899724a4f6","resolution":{"observed_at":"2026-08-02T22:21:42.358283Z","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-02T22:21:42.452616Z","title":"Higher-Order Organization of Com- plex Networks","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2602.17834","last_updated":"2026-06-05T15:55:35Z","snapshot_observed_at":"2026-08-05T10:58:00.325683Z","submitted_at":"2026-02-19T20:57:26Z","title":"Distributed Triangle and Simplex Enumeration in Hypergraphs","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-02T22:21:42.452616Z"},"links":{"citing_paper":"/paper/2602.17834"},"observation_digest":"sha256:2b833cfa303fdb2878e5da8f949737a125136e7e7d31629f572a59498c33d02e","observation_id":"9d4b1672-1c19-455a-9157-34582dad3fbd","resolution":{"observed_at":"2026-08-02T22:21:42.452616Z","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-02T22:21:42.516266Z","title":"Simplicial Closure and Higher-Order Link Prediction","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2602.17834","last_updated":"2026-06-05T15:55:35Z","snapshot_observed_at":"2026-08-05T10:58:00.325683Z","submitted_at":"2026-02-19T20:57:26Z","title":"Distributed Triangle and Simplex Enumeration in Hypergraphs","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-02T22:21:42.516266Z"},"links":{"citing_paper":"/paper/2602.17834"},"observation_digest":"sha256:7c062d6805c5d975425f4afa71977bce8a0f29a70fae3c1aa7e6e47ccf33ac26","observation_id":"dd7693da-c09a-4a55-858e-80c0bbe466d1","resolution":{"observed_at":"2026-08-02T22:21:42.516266Z","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-02T22:21:42.573080Z","title":"Network Traffic Characteristics of Data Centers in the Wild","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2602.17834","last_updated":"2026-06-05T15:55:35Z","snapshot_observed_at":"2026-08-05T10:58:00.325683Z","submitted_at":"2026-02-19T20:57:26Z","title":"Distributed Triangle and Simplex Enumeration in Hypergraphs","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-02T22:21:42.573080Z"},"links":{"citing_paper":"/paper/2602.17834"},"observation_digest":"sha256:5fd26ba33a8c2feaca255fee22fc29531ae9c70e120ca792436d3e627fb51502","observation_id":"aadbfad3-d0cf-4907-9646-3a3eb3782068","resolution":{"observed_at":"2026-08-02T22:21:42.573080Z","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-02T22:21:42.669820Z","title":"Mathematical Engineering","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2602.17834","last_updated":"2026-06-05T15:55:35Z","snapshot_observed_at":"2026-08-05T10:58:00.325683Z","submitted_at":"2026-02-19T20:57:26Z","title":"Distributed Triangle and Simplex Enumeration in Hypergraphs","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-02T22:21:42.669820Z"},"links":{"citing_paper":"/paper/2602.17834"},"observation_digest":"sha256:b7e3ce2de7778ffbfefd3faf5516e745525ef0384b375be50eb7bb9978d9deec","observation_id":"3c996c61-35c1-4724-9f98-60ffdca15b2b","resolution":{"observed_at":"2026-08-02T22:21:42.669820Z","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-02T22:21:42.759011Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.17834","last_updated":"2026-06-05T15:55:35Z","snapshot_observed_at":"2026-08-05T10:58:00.325683Z","submitted_at":"2026-02-19T20:57:26Z","title":"Distributed Triangle and Simplex Enumeration in Hypergraphs","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-02T22:21:42.759011Z"},"links":{"citing_paper":"/paper/2602.17834"},"observation_digest":"sha256:97b4085fe26d45d82d055e5e4894c599efd64df812c80bc15a52df835d0b2f46","observation_id":"c510c4ae-eeab-4ddb-aa72-d219882f5e6c","resolution":{"observed_at":"2026-08-02T22:21:42.759011Z","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-02T22:21:42.834683Z","title":"Counting Simplices in Hypergraph Streams","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2602.17834","last_updated":"2026-06-05T15:55:35Z","snapshot_observed_at":"2026-08-05T10:58:00.325683Z","submitted_at":"2026-02-19T20:57:26Z","title":"Distributed Triangle and Simplex Enumeration in Hypergraphs","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-02T22:21:42.834683Z"},"links":{"citing_paper":"/paper/2602.17834"},"observation_digest":"sha256:74997f113a891e6cfa3e61682af2b860a8ae67a28bc9dc37e6c5e4a7e47086ef","observation_id":"2edd53fa-7302-4274-b44d-05178c6d7479","resolution":{"observed_at":"2026-08-02T22:21:42.834683Z","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-02T22:21:42.888162Z","title":"Near-Optimal Dis- tributed Triangle Enumeration via Expander Decompositions","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2602.17834","last_updated":"2026-06-05T15:55:35Z","snapshot_observed_at":"2026-08-05T10:58:00.325683Z","submitted_at":"2026-02-19T20:57:26Z","title":"Distributed Triangle and Simplex Enumeration in Hypergraphs","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-02T22:21:42.888162Z"},"links":{"citing_paper":"/paper/2602.17834"},"observation_digest":"sha256:f99ee1c09d3477d15ddf7dd739bdb7be9fb341ba854ab2ac603892e90afb1af2","observation_id":"e80f553a-f438-4a31-9c44-e94ae6a3ff10","resolution":{"observed_at":"2026-08-02T22:21:42.888162Z","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-02T22:21:42.946185Z","title":"“Tri, Tri Again","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2602.17834","last_updated":"2026-06-05T15:55:35Z","snapshot_observed_at":"2026-08-05T10:58:00.325683Z","submitted_at":"2026-02-19T20:57:26Z","title":"Distributed Triangle and Simplex Enumeration in Hypergraphs","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-02T22:21:42.946185Z"},"links":{"citing_paper":"/paper/2602.17834"},"observation_digest":"sha256:440c0107fa91c815d6111b0bfc29435878cea9f462c817b25b368f4b83025170","observation_id":"163ce78b-a48f-458a-8247-032d18e115e2","resolution":{"observed_at":"2026-08-02T22:21:42.946185Z","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-02T22:21:43.037074Z","title":"Distributed MST and Routing in Al- most Mixing Time","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2602.17834","last_updated":"2026-06-05T15:55:35Z","snapshot_observed_at":"2026-08-05T10:58:00.325683Z","submitted_at":"2026-02-19T20:57:26Z","title":"Distributed Triangle and Simplex Enumeration in Hypergraphs","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-02T22:21:43.037074Z"},"links":{"citing_paper":"/paper/2602.17834"},"observation_digest":"sha256:5eab7e9d2237b0e154b7942bbb23ea6092fc227c09b0655a02f7960aa8bff4fd","observation_id":"b779241b-e32a-446a-9286-d10531be8901","resolution":{"observed_at":"2026-08-02T22:21:43.037074Z","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-02T22:21:43.241008Z","title":"New Distributed Algorithms in Almost Mixing Time via Transformations from Parallel Algorithms","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2602.17834","last_updated":"2026-06-05T15:55:35Z","snapshot_observed_at":"2026-08-05T10:58:00.325683Z","submitted_at":"2026-02-19T20:57:26Z","title":"Distributed Triangle and Simplex Enumeration in Hypergraphs","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-02T22:21:43.241008Z"},"links":{"citing_paper":"/paper/2602.17834"},"observation_digest":"sha256:a16ed699ea71780711e770dceecf116f96cc03efa01a02d9821f421015faab31","observation_id":"9ff67934-d26a-4b15-9a7c-e59065fb29c4","resolution":{"observed_at":"2026-08-02T22:21:43.241008Z","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-02T22:21:43.337540Z","title":"The Strength of Weak Ties","venue":null,"work_id":null,"year":1973},"citing_paper":{"arxiv_id":"2602.17834","last_updated":"2026-06-05T15:55:35Z","snapshot_observed_at":"2026-08-05T10:58:00.325683Z","submitted_at":"2026-02-19T20:57:26Z","title":"Distributed Triangle and Simplex Enumeration in Hypergraphs","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-02T22:21:43.337540Z"},"links":{"citing_paper":"/paper/2602.17834"},"observation_digest":"sha256:6728608b2551e941b1a160c70b8f957b75dc987423023318ea95c81e8fbbf992","observation_id":"69eff407-feca-4abf-87ff-d1db6ad634e1","resolution":{"observed_at":"2026-08-02T22:21:43.337540Z","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-02T22:21:43.440557Z","title":"Scalable Hypergraph Learning and Processing","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2602.17834","last_updated":"2026-06-05T15:55:35Z","snapshot_observed_at":"2026-08-05T10:58:00.325683Z","submitted_at":"2026-02-19T20:57:26Z","title":"Distributed Triangle and Simplex Enumeration in Hypergraphs","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-02T22:21:43.440557Z"},"links":{"citing_paper":"/paper/2602.17834"},"observation_digest":"sha256:32affdeb2bb581e13ad4ac0a27c3bbf04634c45447677e55ff75fbe94db68959","observation_id":"e40fe2e8-4d33-472b-96fb-629dc22e77c5","resolution":{"observed_at":"2026-08-02T22:21:43.440557Z","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-02T22:21:43.537059Z","title":"Triangle Finding and Listing in CONGEST Networks","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2602.17834","last_updated":"2026-06-05T15:55:35Z","snapshot_observed_at":"2026-08-05T10:58:00.325683Z","submitted_at":"2026-02-19T20:57:26Z","title":"Distributed Triangle and Simplex Enumeration in Hypergraphs","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-02T22:21:43.537059Z"},"links":{"citing_paper":"/paper/2602.17834"},"observation_digest":"sha256:1523c5c0c31aa267fce34cf2816452add036d8e3714180c5973cbb7abac83e0e","observation_id":"9e218c10-c527-48a3-b495-cce504c0b5f9","resolution":{"observed_at":"2026-08-02T22:21:43.537059Z","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-02T22:21:43.672366Z","title":"A Space-Efficient Streaming Algorithm for Esti- mating Transitivity and Triangle Counts Using the Birthday Paradox","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2602.17834","last_updated":"2026-06-05T15:55:35Z","snapshot_observed_at":"2026-08-05T10:58:00.325683Z","submitted_at":"2026-02-19T20:57:26Z","title":"Distributed Triangle and Simplex Enumeration in Hypergraphs","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-02T22:21:43.672366Z"},"links":{"citing_paper":"/paper/2602.17834"},"observation_digest":"sha256:c49046e4fc834cea4f3b63fe8fa2924531f211a2abbc40af0da72674bbe8c402","observation_id":"31c24774-1d82-48a5-9e21-17e973b48339","resolution":{"observed_at":"2026-08-02T22:21:43.672366Z","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-02T22:21:43.804327Z","title":"A Model of Computation for MapReduce","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2602.17834","last_updated":"2026-06-05T15:55:35Z","snapshot_observed_at":"2026-08-05T10:58:00.325683Z","submitted_at":"2026-02-19T20:57:26Z","title":"Distributed Triangle and Simplex Enumeration in Hypergraphs","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-02T22:21:43.804327Z"},"links":{"citing_paper":"/paper/2602.17834"},"observation_digest":"sha256:4a1cc5a6c3fe0d397cabe50daff6c967a485cf3626e48b17bab55d51e271b991","observation_id":"71d296b8-7cae-40c9-b3c6-9bc9c961a7e7","resolution":{"observed_at":"2026-08-02T22:21:43.804327Z","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-02T22:21:43.893651Z","title":"Multilayer Networks","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2602.17834","last_updated":"2026-06-05T15:55:35Z","snapshot_observed_at":"2026-08-05T10:58:00.325683Z","submitted_at":"2026-02-19T20:57:26Z","title":"Distributed Triangle and Simplex Enumeration in Hypergraphs","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-02T22:21:43.893651Z"},"links":{"citing_paper":"/paper/2602.17834"},"observation_digest":"sha256:48d3d9147bd7c0db98468ec92ef5810e3d3b6d7f893111f5ea666e1ece454958","observation_id":"e2784f91-2479-446d-8ead-fb60f4117691","resolution":{"observed_at":"2026-08-02T22:21:43.893651Z","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-02T22:21:43.954516Z","title":"LOTUS: Locality Op- timizing Triangle Counting","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2602.17834","last_updated":"2026-06-05T15:55:35Z","snapshot_observed_at":"2026-08-05T10:58:00.325683Z","submitted_at":"2026-02-19T20:57:26Z","title":"Distributed Triangle and Simplex Enumeration in Hypergraphs","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-02T22:21:43.954516Z"},"links":{"citing_paper":"/paper/2602.17834"},"observation_digest":"sha256:d29ab32a4fc12a1adead00dd63be5d0e6f18b9f613daa5728ebca2097656c098","observation_id":"83f674c4-994b-446c-b634-c61b8d47c000","resolution":{"observed_at":"2026-08-02T22:21:43.954516Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1805.03357","last_updated":"2018-05-09T03:04:45Z","snapshot_observed_at":"2026-07-06T06:38:07.649939Z","submitted_at":"2018-05-09T03:04:45Z","title":"Efficient Distributed Computation of MIS and Generalized MIS in Linear Hypergraphs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1805.03357","snapshot_observed_at":"2026-08-02T22:21:44.043699Z","title":"Efficient distributed computation of MIS and generalized MIS in linear hypergraphs","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2602.17834","last_updated":"2026-06-05T15:55:35Z","snapshot_observed_at":"2026-08-05T10:58:00.325683Z","submitted_at":"2026-02-19T20:57:26Z","title":"Distributed Triangle and Simplex Enumeration in Hypergraphs","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-02T22:21:44.043699Z"},"links":{"cited_paper":"/paper/1805.03357","citing_paper":"/paper/2602.17834"},"observation_digest":"sha256:8ebc776f8d957be19f6a07bf89008f1c3830118e217e62f4d5a8def52a6874b4","observation_id":"f6efbb49-0535-4bf3-a45f-f0c4dc652b73","resolution":{"observed_at":"2026-08-02T22:21:44.043699Z","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-02T22:21:44.128485Z","title":"Distributed Symmetry Breaking in Hypergraphs","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2602.17834","last_updated":"2026-06-05T15:55:35Z","snapshot_observed_at":"2026-08-05T10:58:00.325683Z","submitted_at":"2026-02-19T20:57:26Z","title":"Distributed Triangle and Simplex Enumeration in Hypergraphs","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-02T22:21:44.128485Z"},"links":{"citing_paper":"/paper/2602.17834"},"observation_digest":"sha256:88949f05705d815af519eed0611943e16bb7e08e5d0711f64469eb565e070179","observation_id":"429a5fe8-c3bb-421f-b02d-6b615f31a2bf","resolution":{"observed_at":"2026-08-02T22:21:44.128485Z","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-02T22:21:44.219947Z","title":"Encapsulation Structure and Dynamics in Hyper- graphs","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2602.17834","last_updated":"2026-06-05T15:55:35Z","snapshot_observed_at":"2026-08-05T10:58:00.325683Z","submitted_at":"2026-02-19T20:57:26Z","title":"Distributed Triangle and Simplex Enumeration in Hypergraphs","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-02T22:21:44.219947Z"},"links":{"citing_paper":"/paper/2602.17834"},"observation_digest":"sha256:68ad060f7a204e09f590dba6b9a6ed66417f53b9b2709c15f93ac44df71655c6","observation_id":"5ca82713-8450-4cd6-b7bd-320a82221421","resolution":{"observed_at":"2026-08-02T22:21:44.219947Z","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-02T22:21:44.330565Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.17834","last_updated":"2026-06-05T15:55:35Z","snapshot_observed_at":"2026-08-05T10:58:00.325683Z","submitted_at":"2026-02-19T20:57:26Z","title":"Distributed Triangle and Simplex Enumeration in Hypergraphs","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-02T22:21:44.330565Z"},"links":{"citing_paper":"/paper/2602.17834"},"observation_digest":"sha256:0388a49900617d2a972c0235d35228216170f12c0adea92be8c89fa87c523f7e","observation_id":"ca677f72-2195-4ec9-b471-0d68e2f23c90","resolution":{"observed_at":"2026-08-02T22:21:44.330565Z","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-02T22:21:44.413819Z","title":"Optimal Deterministic Routing and Sorting on the Congested Clique","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2602.17834","last_updated":"2026-06-05T15:55:35Z","snapshot_observed_at":"2026-08-05T10:58:00.325683Z","submitted_at":"2026-02-19T20:57:26Z","title":"Distributed Triangle and Simplex Enumeration in Hypergraphs","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-02T22:21:44.413819Z"},"links":{"citing_paper":"/paper/2602.17834"},"observation_digest":"sha256:174d8bf1581487951bc862258610ee4ee4df0f52553dd7be31841a8cd80e71e2","observation_id":"55701f5c-78dd-49e1-b097-ca0bdaa7a0ee","resolution":{"observed_at":"2026-08-02T22:21:44.413819Z","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-02T22:21:44.494964Z","title":"Locality in Distributed Graph Algorithms","venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"2602.17834","last_updated":"2026-06-05T15:55:35Z","snapshot_observed_at":"2026-08-05T10:58:00.325683Z","submitted_at":"2026-02-19T20:57:26Z","title":"Distributed Triangle and Simplex Enumeration in Hypergraphs","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-02T22:21:44.494964Z"},"links":{"citing_paper":"/paper/2602.17834"},"observation_digest":"sha256:5f6118cdbed4a955662c5daaaa860da8e66e82f3e4797fcb9169a2f3312c8b45","observation_id":"f61f0073-764a-4bf9-8f1a-7321842dccdb","resolution":{"observed_at":"2026-08-02T22:21:44.494964Z","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-02T22:21:44.619974Z","title":"Minimum-Weight Spanning Tree Construction in O(Log Log n) Communication Rounds","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2602.17834","last_updated":"2026-06-05T15:55:35Z","snapshot_observed_at":"2026-08-05T10:58:00.325683Z","submitted_at":"2026-02-19T20:57:26Z","title":"Distributed Triangle and Simplex Enumeration in Hypergraphs","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-02T22:21:44.619974Z"},"links":{"citing_paper":"/paper/2602.17834"},"observation_digest":"sha256:fc9ad38c8b86905ad6c798fa947d3bacced9fe6e9eb48103330c4b8306396308","observation_id":"427d6fd4-eabd-41db-9416-8bc68b04f3e4","resolution":{"observed_at":"2026-08-02T22:21:44.619974Z","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-02T22:21:44.739603Z","title":"Network Motifs: Simple Building Blocks of Complex Networks","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2602.17834","last_updated":"2026-06-05T15:55:35Z","snapshot_observed_at":"2026-08-05T10:58:00.325683Z","submitted_at":"2026-02-19T20:57:26Z","title":"Distributed Triangle and Simplex Enumeration in Hypergraphs","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-02T22:21:44.739603Z"},"links":{"citing_paper":"/paper/2602.17834"},"observation_digest":"sha256:34e07c85e60ffd95b84a1d347cc3eb28d969a76d4fe43634725fcb708f430185","observation_id":"8c3ab9c2-2c08-4b36-95b2-b5a07e848ee9","resolution":{"observed_at":"2026-08-02T22:21:44.739603Z","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-02T22:21:44.862275Z","title":"Decomposition of Finite Graphs into Forests","venue":null,"work_id":null,"year":1964},"citing_paper":{"arxiv_id":"2602.17834","last_updated":"2026-06-05T15:55:35Z","snapshot_observed_at":"2026-08-05T10:58:00.325683Z","submitted_at":"2026-02-19T20:57:26Z","title":"Distributed Triangle and Simplex Enumeration in Hypergraphs","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-02T22:21:44.862275Z"},"links":{"citing_paper":"/paper/2602.17834"},"observation_digest":"sha256:91f63aecdff4f8fb0754d07dd73e487ebd190b1bc63536fe28bd2cac3769f026","observation_id":"214b1bbf-5218-4533-bb0a-77eec938b8c5","resolution":{"observed_at":"2026-08-02T22:21:44.862275Z","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-02T22:21:44.955342Z","title":"The Structure and Function of Complex Networks","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2602.17834","last_updated":"2026-06-05T15:55:35Z","snapshot_observed_at":"2026-08-05T10:58:00.325683Z","submitted_at":"2026-02-19T20:57:26Z","title":"Distributed Triangle and Simplex Enumeration in Hypergraphs","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-02T22:21:44.955342Z"},"links":{"citing_paper":"/paper/2602.17834"},"observation_digest":"sha256:93d06854dfb5dcc619c78f59b2331e61aa7a01debef5573b0b5c523adca1eeeb","observation_id":"a033e45b-f13b-4322-92c9-e26d89198fac","resolution":{"observed_at":"2026-08-02T22:21:44.955342Z","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-02T22:21:45.033517Z","title":"On the Distributed Complex- ity of Large-Scale Graph Computations","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2602.17834","last_updated":"2026-06-05T15:55:35Z","snapshot_observed_at":"2026-08-05T10:58:00.325683Z","submitted_at":"2026-02-19T20:57:26Z","title":"Distributed Triangle and Simplex Enumeration in Hypergraphs","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-02T22:21:45.033517Z"},"links":{"citing_paper":"/paper/2602.17834"},"observation_digest":"sha256:b397fad6d94a480be8554e3697ce7158bb5324b3816b210e31ac055bc08e963d","observation_id":"3e753bf9-da36-4fb5-930c-76014a6ede51","resolution":{"observed_at":"2026-08-02T22:21:45.033517Z","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-02T22:21:45.126625Z","title":"Society for Industrial and Applied Mathematics, 2000","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2602.17834","last_updated":"2026-06-05T15:55:35Z","snapshot_observed_at":"2026-08-05T10:58:00.325683Z","submitted_at":"2026-02-19T20:57:26Z","title":"Distributed Triangle and Simplex Enumeration in Hypergraphs","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-02T22:21:45.126625Z"},"links":{"citing_paper":"/paper/2602.17834"},"observation_digest":"sha256:25d06bfb896abe4526834e6cecc0e1fb514ef737de12ecb1db61d170bfa8f31a","observation_id":"714abad7-bb6e-4bef-ae6f-a16d2ba87350","resolution":{"observed_at":"2026-08-02T22:21:45.126625Z","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-02T22:21:45.235649Z","title":"Peterson and Bruce S","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2602.17834","last_updated":"2026-06-05T15:55:35Z","snapshot_observed_at":"2026-08-05T10:58:00.325683Z","submitted_at":"2026-02-19T20:57:26Z","title":"Distributed Triangle and Simplex Enumeration in Hypergraphs","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-02T22:21:45.235649Z"},"links":{"citing_paper":"/paper/2602.17834"},"observation_digest":"sha256:b6a0c5987a03735e204c91bccf1641277f40e3c9989aa2fe23995016d00d3fd8","observation_id":"c29e9428-d158-4b50-8683-fd623cca2343","resolution":{"observed_at":"2026-08-02T22:21:45.235649Z","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-02T22:21:45.318780Z","title":"Counting Cycles and Finite Dimensional Lp Norms","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2602.17834","last_updated":"2026-06-05T15:55:35Z","snapshot_observed_at":"2026-08-05T10:58:00.325683Z","submitted_at":"2026-02-19T20:57:26Z","title":"Distributed Triangle and Simplex Enumeration in Hypergraphs","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-02T22:21:45.318780Z"},"links":{"citing_paper":"/paper/2602.17834"},"observation_digest":"sha256:9bf0aa3ef65336f882d51729bcb07d75b814d1b8dc502dc3073bc5fd5a12bbf7","observation_id":"ecc359c7-33f0-436a-98aa-af78c42f3a82","resolution":{"observed_at":"2026-08-02T22:21:45.318780Z","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-02T22:21:45.392406Z","title":"Approximate Counting, Uniform Generation and Rapidly Mixing Markov Chains","venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2602.17834","last_updated":"2026-06-05T15:55:35Z","snapshot_observed_at":"2026-08-05T10:58:00.325683Z","submitted_at":"2026-02-19T20:57:26Z","title":"Distributed Triangle and Simplex Enumeration in Hypergraphs","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-02T22:21:45.392406Z"},"links":{"citing_paper":"/paper/2602.17834"},"observation_digest":"sha256:297934bd576b4a7c62dd2b2b80218a4abfeca88467c1b71928d911e63dadf239","observation_id":"5cdd3957-7568-46b9-adc7-f2073978f11a","resolution":{"observed_at":"2026-08-02T22:21:45.392406Z","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-02T22:21:45.468297Z","title":"Triangle-Aware Spectral Spar- sifiers and Community Detection","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2602.17834","last_updated":"2026-06-05T15:55:35Z","snapshot_observed_at":"2026-08-05T10:58:00.325683Z","submitted_at":"2026-02-19T20:57:26Z","title":"Distributed Triangle and Simplex Enumeration in Hypergraphs","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-02T22:21:45.468297Z"},"links":{"citing_paper":"/paper/2602.17834"},"observation_digest":"sha256:e0a74f7be94dc6ed21f7850d3bad3f5603de09ce1e037ff63c42f2cb4a40e080","observation_id":"0982232a-949c-426d-b641-e67f3c75eafa","resolution":{"observed_at":"2026-08-02T22:21:45.468297Z","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-02T22:21:45.543588Z","title":"Counting Triangles in Real-World Networks Using Projec- tions","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2602.17834","last_updated":"2026-06-05T15:55:35Z","snapshot_observed_at":"2026-08-05T10:58:00.325683Z","submitted_at":"2026-02-19T20:57:26Z","title":"Distributed Triangle and Simplex Enumeration in Hypergraphs","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-02T22:21:45.543588Z"},"links":{"citing_paper":"/paper/2602.17834"},"observation_digest":"sha256:c2fb50fe6c3cff93c8ebb961dcf7a5a1883b235933cb0a4955ff161376540bad","observation_id":"4c5599fa-d876-4c75-8b69-b76248a7f809","resolution":{"observed_at":"2026-08-02T22:21:45.543588Z","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-02T22:21:45.652982Z","title":"Collective Dynamics of ‘Small-World’ Networks","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2602.17834","last_updated":"2026-06-05T15:55:35Z","snapshot_observed_at":"2026-08-05T10:58:00.325683Z","submitted_at":"2026-02-19T20:57:26Z","title":"Distributed Triangle and Simplex Enumeration in Hypergraphs","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-02T22:21:45.652982Z"},"links":{"citing_paper":"/paper/2602.17834"},"observation_digest":"sha256:21bfd449d0b15f4a1bb60e0d0304d353b5451c19fda634fbef01f6dea7a8388e","observation_id":"795e4c54-698a-4064-8aa8-d4011abb8133","resolution":{"observed_at":"2026-08-02T22:21:45.652982Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2602.17834","last_updated":"2026-06-05T15:55:35Z","latest_version":2,"primary_category":"cs.DC","snapshot_observed_at":"2026-08-05T10:58:00.325683Z","submitted_at":"2026-02-19T20:57:26Z","title":"Distributed Triangle and Simplex Enumeration in Hypergraphs"},"reference_resolution":{"displayed":44,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":44,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":44},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 44 of 44 outbound references and 0 inbound Pith citation observations for arXiv:2602.17834."}