{"as_of":"2026-08-08T07:18:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:fd78e1f7c8672dd4115909a5b485c08444493da2985a8c8aea4c026a9226115a","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T15:27:43.399197Z","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-07-03T20:28:55.709581Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.15564","last_updated":"2025-02-21T16:24:24Z","snapshot_observed_at":"2026-08-07T17:58:06.450954Z","submitted_at":"2025-02-21T16:24:24Z","title":"Adaptive Expansion for Hypergraph Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.15564","snapshot_observed_at":"2026-08-07T15:27:43.399197Z","title":"Adaptive expansion for hypergraph learning.arXiv preprint arXiv:2502.15564, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.15859","last_updated":"2025-05-21T04:32:35Z","snapshot_observed_at":"2026-08-07T15:21:59.167327Z","submitted_at":"2025-05-21T04:32:35Z","title":"AutoData: A Multi-Agent System for Open Web Data Collection","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T15:27:43.399197Z"},"links":{"cited_paper":"/paper/2502.15564","citing_paper":"/paper/2505.15859"},"observation_digest":"sha256:1ec7f8788d84f61d1e594f69937b9837dab5f2b1607287a8724c24332b57403a","observation_id":"db1eba95-7604-4223-9fed-849ffea05431","resolution":{"observed_at":"2026-08-07T15:27:43.399197Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.15564","last_updated":"2025-02-21T16:24:24Z","snapshot_observed_at":"2026-08-07T17:58:06.450954Z","submitted_at":"2025-02-21T16:24:24Z","title":"Adaptive Expansion for Hypergraph Learning","version":1},"cited_work":{"arxiv_id":"2502.15564","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.15564","snapshot_observed_at":"2026-07-03T20:28:55.709581Z","title":"Adaptive expansion for hypergraph learning","venue":null,"work_id":"1d4d353b-cc0d-4a7f-b3b6-65d5bd1f286d","year":2025},"citing_paper":{"arxiv_id":"2605.16527","last_updated":"2026-05-15T18:24:37Z","snapshot_observed_at":"2026-07-06T23:27:38.955917Z","submitted_at":"2026-05-15T18:24:37Z","title":"Hypergraph Pattern Machine: Compositional Tokenization for Higher-Order Interactions","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-05-20T20:09:55.428895Z"},"links":{"cited_paper":"/paper/2502.15564","citing_paper":"/paper/2605.16527"},"observation_digest":"sha256:631fdacf336d972595d972b1153b8c2718f40e20f58117b50c8fa7f332eb68b6","observation_id":"f6f11640-87b6-41ce-b5c9-0061cdbbb038","resolution":{"observed_at":"2026-05-20T20:13:43.928979Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.15564","last_updated":"2025-02-21T16:24:24Z","snapshot_observed_at":"2026-08-07T17:58:06.450954Z","submitted_at":"2025-02-21T16:24:24Z","title":"Adaptive Expansion for Hypergraph Learning","version":1},"cited_work":{"arxiv_id":"2502.15564","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.15564","snapshot_observed_at":"2026-07-03T20:28:55.709581Z","title":"Adaptive expansion for hypergraph learning","venue":null,"work_id":"1d4d353b-cc0d-4a7f-b3b6-65d5bd1f286d","year":2025},"citing_paper":{"arxiv_id":"2606.17637","last_updated":"2026-06-16T07:46:51Z","snapshot_observed_at":"2026-08-04T04:29:46.048474Z","submitted_at":"2026-06-16T07:46:51Z","title":"Brick-DICL: Dynamic In-Context Learning for Automated Brick Schema Classification","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-06-27T01:18:51.949702Z"},"links":{"cited_paper":"/paper/2502.15564","citing_paper":"/paper/2606.17637"},"observation_digest":"sha256:d2437c96f0a97dd2265940682341be02542a0ff08f8f359295748fc81a250422","observation_id":"eb6274fc-c3ef-4664-9596-9d6ed9178e97","resolution":{"observed_at":"2026-07-03T20:28:55.711408Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2502.15564/citation-record","integrity":"/paper/2502.15564/integrity","json":"/paper/2502.15564/citation-record.json","paper":"/paper/2502.15564"},"outbound":[],"paper":{"arxiv_id":"2502.15564","last_updated":"2025-02-21T16:24:24Z","latest_version":1,"primary_category":"cs.SI","snapshot_observed_at":"2026-08-07T17:58:06.450954Z","submitted_at":"2025-02-21T16:24:24Z","title":"Adaptive Expansion for Hypergraph Learning"},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2502.15564."}