{"as_of":"2026-08-09T22:22:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b2daec8665520cca8190d49721a25e4dfbcd9ceece801443b0801c2d8fdbc058","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T20:29:43.902034Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-11T07:41:01.627747Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"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":{"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":"2402.11339","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.11339","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Expressive higher-order link prediction through hypergraph symmetry breaking.arXiv preprint arXiv:2402.11339","venue":null,"work_id":"f5b265c8-73df-442b-b629-8162468f4bf7","year":null},"citing_paper":{"arxiv_id":"2604.08404","last_updated":"2026-04-20T18:01:41Z","snapshot_observed_at":"2026-07-06T22:57:31.046146Z","submitted_at":"2026-04-09T16:02:07Z","title":"Adversarial Label Invariant Graph Data Augmentations for Out-of-Distribution Generalization","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-10T17:00:51.046061Z"},"links":{"cited_paper":"/paper/2402.11339","citing_paper":"/paper/2604.08404"},"observation_digest":"sha256:1a1149d99dae7bc7803e29e1331717f9402894bafb9465bc8d073225fe2be8ac","observation_id":"f6c73f6b-f92e-4bf2-a2c9-ec0a068e274d","resolution":{"observed_at":"2026-05-11T07:41:01.629215Z","resolver_source":"arxiv_id","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"}}],"links":{"evidence":"/evidence","html":"/paper/2402.11339/citation-record","integrity":"/paper/2402.11339/integrity","json":"/paper/2402.11339/citation-record.json","paper":"/paper/2402.11339"},"outbound":[],"paper":{"arxiv_id":"2402.11339","last_updated":"2024-12-03T03:42:45Z","latest_version":2,"primary_category":"cs.LG","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"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2402.11339."}