{"as_of":"2026-08-11T03:11:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:45f92c54abe4d02148f0b7adac32be04a61f0ff690e3327dce90b27e249bfe90","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":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T15:00:24.597659Z","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-18T04:52:23.431939Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2410.01635","last_updated":"2025-05-27T04:43:17Z","snapshot_observed_at":"2026-08-10T12:42:52.698602Z","submitted_at":"2024-10-02T15:07:13Z","title":"Does Graph Prompt Work? A Data Operation Perspective with Theoretical Analysis","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.01635","snapshot_observed_at":"2026-08-07T15:00:24.597659Z","title":"Does graph prompt work? a data operation perspective with theoretical analysis","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.16860","last_updated":"2025-05-22T16:19:19Z","snapshot_observed_at":"2026-08-10T10:11:37.902918Z","submitted_at":"2025-05-22T16:19:19Z","title":"GCAL: Adapting Graph Models to Evolving Domain Shifts","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T15:00:24.597659Z"},"links":{"cited_paper":"/paper/2410.01635","citing_paper":"/paper/2505.16860"},"observation_digest":"sha256:078d5e4e1afb51254c817c345135d690b5b39642b20c6eb7980d404821f8342a","observation_id":"32c9db38-3323-4261-8c82-26466ef0831f","resolution":{"observed_at":"2026-08-07T15:00:24.597659Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.01635","last_updated":"2025-05-27T04:43:17Z","snapshot_observed_at":"2026-08-10T12:42:52.698602Z","submitted_at":"2024-10-02T15:07:13Z","title":"Does Graph Prompt Work? A Data Operation Perspective with Theoretical Analysis","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.01635","snapshot_observed_at":"2026-08-07T05:17:17.212294Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.08326","last_updated":"2025-06-10T01:27:19Z","snapshot_observed_at":"2026-08-09T14:48:30.926093Z","submitted_at":"2025-06-10T01:27:19Z","title":"Graph Prompting for Graph Learning Models: Recent Advances and Future Directions","version":1},"reference_index":101,"source":"pdf_text","source_observed_at":"2026-08-07T05:17:17.212294Z"},"links":{"cited_paper":"/paper/2410.01635","citing_paper":"/paper/2506.08326"},"observation_digest":"sha256:cd20edc08d4ddaad21990d6a7d20f28175574c99f68f2e9a4f6a27e915a88871","observation_id":"93071ea4-a3bc-49be-a45d-ff1b425ff711","resolution":{"observed_at":"2026-08-07T05:17:17.212294Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.01635","last_updated":"2025-05-27T04:43:17Z","snapshot_observed_at":"2026-08-10T12:42:52.698602Z","submitted_at":"2024-10-02T15:07:13Z","title":"Does Graph Prompt Work? A Data Operation Perspective with Theoretical Analysis","version":2},"cited_work":{"arxiv_id":"2410.01635","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.01635","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Does graph prompt work? a data operation perspective with theoretical analysis","venue":null,"work_id":"b1d90db2-4fdc-4f13-8929-bcdeefdf3d4d","year":2024},"citing_paper":{"arxiv_id":"2510.22555","last_updated":"2026-05-05T03:00:23Z","snapshot_observed_at":"2026-08-04T23:07:25.119627Z","submitted_at":"2025-10-26T07:10:07Z","title":"Cross-Paradigm Graph Backdoor Attacks with Promptable Subgraph Triggers","version":3},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-18T04:51:23.281272Z"},"links":{"cited_paper":"/paper/2410.01635","citing_paper":"/paper/2510.22555"},"observation_digest":"sha256:b86894d1c617fd90d79b150d5abafd9b71bb323ccef40af507598e2fe3391e2c","observation_id":"9b86a69d-8009-475f-8f40-d4d5817215ae","resolution":{"observed_at":"2026-05-18T04:52:23.433893Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.01635","last_updated":"2025-05-27T04:43:17Z","snapshot_observed_at":"2026-08-10T12:42:52.698602Z","submitted_at":"2024-10-02T15:07:13Z","title":"Does Graph Prompt Work? A Data Operation Perspective with Theoretical Analysis","version":2},"cited_work":{"arxiv_id":"2410.01635","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.01635","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Does graph prompt work? a data operation perspective with theoretical analysis","venue":null,"work_id":"b1d90db2-4fdc-4f13-8929-bcdeefdf3d4d","year":2024},"citing_paper":{"arxiv_id":"2605.12061","last_updated":"2026-05-12T12:47:43Z","snapshot_observed_at":"2026-08-06T07:22:02.201477Z","submitted_at":"2026-05-12T12:47:43Z","title":"SAGE: A Self-Evolving Agentic Graph-Memory Engine for Structure-Aware Associative Memory","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-05-13T04:45:34.957298Z"},"links":{"cited_paper":"/paper/2410.01635","citing_paper":"/paper/2605.12061"},"observation_digest":"sha256:5618a0a9c21ac142c5714282f85e8cf88833f91c7f00761075a8893d1b97f797","observation_id":"f17068b7-8385-46c5-8c32-720ea85d08fc","resolution":{"observed_at":"2026-05-13T04:57:17.725167Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2410.01635/citation-record","integrity":"/paper/2410.01635/integrity","json":"/paper/2410.01635/citation-record.json","paper":"/paper/2410.01635"},"outbound":[],"paper":{"arxiv_id":"2410.01635","last_updated":"2025-05-27T04:43:17Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-10T12:42:52.698602Z","submitted_at":"2024-10-02T15:07:13Z","title":"Does Graph Prompt Work? A Data Operation Perspective with Theoretical Analysis"},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:2410.01635."}