{"as_of":"2026-08-21T18:45:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ffbe7eb801d172e152644f37ad9de4c6b3ab703a1590931788e84fdfb7a78fcc","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":5,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":5,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+00:00","state":"measured"},{"denominator":5,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":5,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T21:58:22.039654Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-07-09T11:46:12.985698Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2106.12144","last_updated":"2022-02-01T21:17:08Z","snapshot_observed_at":"2026-08-20T03:00:33.036170Z","submitted_at":"2021-06-23T03:51:03Z","title":"NodePiece: Compositional and Parameter-Efficient Representations of Large Knowledge Graphs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2106.12144","snapshot_observed_at":"2026-08-12T21:58:22.039654Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2411.08172","last_updated":"2024-11-12T20:32:36Z","snapshot_observed_at":"2026-08-17T21:29:54.043598Z","submitted_at":"2024-11-12T20:32:36Z","title":"Fault Localization in Deep Learning-based Software: A System-level Approach","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-12T21:58:22.039654Z"},"links":{"cited_paper":"/paper/2106.12144","citing_paper":"/paper/2411.08172"},"observation_digest":"sha256:55039c2b52709444e9f1755a796566ba54aacf51e41629e61d91200162cce224","observation_id":"7675641f-0d7d-4355-bdda-9706e14b1ef7","resolution":{"observed_at":"2026-08-12T21:58:22.039654Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2106.12144","last_updated":"2022-02-01T21:17:08Z","snapshot_observed_at":"2026-08-20T03:00:33.036170Z","submitted_at":"2021-06-23T03:51:03Z","title":"NodePiece: Compositional and Parameter-Efficient Representations of Large Knowledge Graphs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2106.12144","snapshot_observed_at":"2026-08-07T13:25:16.309043Z","title":"Hamilton","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.21926","last_updated":"2025-05-28T03:21:28Z","snapshot_observed_at":"2026-08-18T01:42:05.057438Z","submitted_at":"2025-05-28T03:21:28Z","title":"Beyond Completion: A Foundation Model for General Knowledge Graph Reasoning","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-07T13:25:16.309043Z"},"links":{"cited_paper":"/paper/2106.12144","citing_paper":"/paper/2505.21926"},"observation_digest":"sha256:1edd6821b50ca48875a4d39b0aed156579c0c7ed84b879d170f8aa1264188216","observation_id":"bf9db780-e2d5-4f91-99bf-59b39d7b3a79","resolution":{"observed_at":"2026-08-07T13:25:16.309043Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2106.12144","last_updated":"2022-02-01T21:17:08Z","snapshot_observed_at":"2026-08-20T03:00:33.036170Z","submitted_at":"2021-06-23T03:51:03Z","title":"NodePiece: Compositional and Parameter-Efficient Representations of Large Knowledge Graphs","version":2},"cited_work":{"arxiv_id":"2106.12144","doi":null,"metadata_source":"pith","pith_arxiv_id":"2106.12144","snapshot_observed_at":"2026-07-09T11:46:12.985698Z","title":"NodePiece: Compositional and Parameter-Efficient Representations of Large Knowledge Graphs","venue":"cs.CL","work_id":"f4a25fc3-af8e-46f6-bba7-8998472b4046","year":2021},"citing_paper":{"arxiv_id":"2510.12369","last_updated":"2026-05-27T13:44:50Z","snapshot_observed_at":"2026-08-18T22:34:48.984542Z","submitted_at":"2025-10-14T10:36:43Z","title":"A Hierarchical Quantized Tokenization Framework for Task-Adaptive Graph Representation Learning","version":3},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-25T07:49:39.057087Z"},"links":{"cited_paper":"/paper/2106.12144","citing_paper":"/paper/2510.12369"},"observation_digest":"sha256:2e76ca762191be8d9afeed161e69a4bb7401340a5277082ed773299bb6aaee2f","observation_id":"f4a9bfa0-e8cd-4abf-9578-85ba8f7faab1","resolution":{"observed_at":"2026-05-25T07:50:28.962953Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2106.12144","last_updated":"2022-02-01T21:17:08Z","snapshot_observed_at":"2026-08-20T03:00:33.036170Z","submitted_at":"2021-06-23T03:51:03Z","title":"NodePiece: Compositional and Parameter-Efficient Representations of Large Knowledge Graphs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2106.12144","snapshot_observed_at":"2026-08-04T10:00:48.022787Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2510.12369","last_updated":"2026-05-27T13:44:50Z","snapshot_observed_at":"2026-08-18T22:34:48.984542Z","submitted_at":"2025-10-14T10:36:43Z","title":"A Hierarchical Quantized Tokenization Framework for Task-Adaptive Graph Representation Learning","version":4},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-04T10:00:48.022787Z"},"links":{"cited_paper":"/paper/2106.12144","citing_paper":"/paper/2510.12369"},"observation_digest":"sha256:4ebd68b0ea51f81056970f54e46aa3e7ef65225b0aa671b7560853b9e4029b55","observation_id":"8d710772-6dcf-48a7-bf89-a260bab36fb3","resolution":{"observed_at":"2026-08-04T10:00:48.022787Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2106.12144","last_updated":"2022-02-01T21:17:08Z","snapshot_observed_at":"2026-08-20T03:00:33.036170Z","submitted_at":"2021-06-23T03:51:03Z","title":"NodePiece: Compositional and Parameter-Efficient Representations of Large Knowledge Graphs","version":2},"cited_work":{"arxiv_id":"2106.12144","doi":null,"metadata_source":"pith","pith_arxiv_id":"2106.12144","snapshot_observed_at":"2026-07-09T11:46:12.985698Z","title":"NodePiece: Compositional and Parameter-Efficient Representations of Large Knowledge Graphs","venue":"cs.CL","work_id":"f4a25fc3-af8e-46f6-bba7-8998472b4046","year":2021},"citing_paper":{"arxiv_id":"2607.07422","last_updated":"2026-07-08T13:49:44Z","snapshot_observed_at":"2026-08-17T04:38:02.196752Z","submitted_at":"2026-07-08T13:49:44Z","title":"InductWave: Inductive Multi-Hop Logical Query Answering on Knowledge Graphs","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-09T11:39:24.051110Z"},"links":{"cited_paper":"/paper/2106.12144","citing_paper":"/paper/2607.07422"},"observation_digest":"sha256:9664317f602bf8cd63147bc3a41c66b464f069dc2f0f2c5a0496dda1f2caca75","observation_id":"7c362e24-9292-446a-bd63-18fe86cc2dad","resolution":{"observed_at":"2026-07-09T11:46:12.987048Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2106.12144/citation-record","integrity":"/paper/2106.12144/integrity","json":"/paper/2106.12144/citation-record.json","paper":"/paper/2106.12144"},"outbound":[],"paper":{"arxiv_id":"2106.12144","last_updated":"2022-02-01T21:17:08Z","latest_version":2,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-20T03:00:33.036170Z","submitted_at":"2021-06-23T03:51:03Z","title":"NodePiece: Compositional and Parameter-Efficient Representations of Large Knowledge Graphs"},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:2106.12144."}