{"as_of":"2026-08-23T18:23:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0fad98602a64f4a3d6611ffe426b45b043330764f69ff97f826789c6f5b6b7ca","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-23T06:30:58.430688+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-10T17:12:00.623994Z","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-08-09T04:16:22.582612Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2007.12035","last_updated":"2020-07-23T14:30:51Z","snapshot_observed_at":"2026-08-12T19:13:56.142644Z","submitted_at":"2020-07-23T14:30:51Z","title":"The expressive power of kth-order invariant graph networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2007.12035","snapshot_observed_at":"2026-08-10T17:12:00.623994Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2501.12554","last_updated":"2025-01-24T19:57:02Z","snapshot_observed_at":"2026-08-18T01:52:59.676967Z","submitted_at":"2025-01-22T00:20:26Z","title":"Generalization Performance of Hypergraph Neural Networks","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-10T17:12:00.623994Z"},"links":{"cited_paper":"/paper/2007.12035","citing_paper":"/paper/2501.12554"},"observation_digest":"sha256:83e49e25dca60b2a79ad21352e223bb2c9b20c62bedf54b02257bdd658c6d161","observation_id":"a9334fa8-c908-4f3b-9025-022afa01ed59","resolution":{"observed_at":"2026-08-10T17:12:00.623994Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2007.12035","last_updated":"2020-07-23T14:30:51Z","snapshot_observed_at":"2026-08-12T19:13:56.142644Z","submitted_at":"2020-07-23T14:30:51Z","title":"The expressive power of kth-order invariant graph networks","version":1},"cited_work":{"arxiv_id":"2007.12035","doi":null,"metadata_source":"pith","pith_arxiv_id":"2007.12035","snapshot_observed_at":"2026-08-09T04:16:22.582612Z","title":"The expressive power of kth-order invariant graph networks","venue":"cs.LG","work_id":"36c7c921-d22c-44c1-af74-94b29e5c78bd","year":2020},"citing_paper":{"arxiv_id":"2502.03703","last_updated":"2025-02-06T01:25:22Z","snapshot_observed_at":"2026-08-20T00:19:43.792437Z","submitted_at":"2025-02-06T01:25:22Z","title":"On the Expressive Power of Subgraph Graph Neural Networks for Graphs with Bounded Cycles","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-09T04:16:22.269145Z"},"links":{"cited_paper":"/paper/2007.12035","citing_paper":"/paper/2502.03703"},"observation_digest":"sha256:cc7b89be19b3b0ffc2c94a13adb082b99dc52d83cff028d1b9844bd50df29b21","observation_id":"42808088-1177-47d6-ab55-bbd6b4a8b082","resolution":{"observed_at":"2026-08-09T04:16:22.587847Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2007.12035","last_updated":"2020-07-23T14:30:51Z","snapshot_observed_at":"2026-08-12T19:13:56.142644Z","submitted_at":"2020-07-23T14:30:51Z","title":"The expressive power of kth-order invariant graph networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2007.12035","snapshot_observed_at":"2026-08-04T09:26:09.070201Z","title":"The expressive power of kth-order invariant graph networks, July 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2510.15814","last_updated":"2026-06-04T13:53:04Z","snapshot_observed_at":"2026-08-15T15:22:43.884309Z","submitted_at":"2025-10-17T16:51:31Z","title":"On Universality of Deep Equivariant Networks","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-04T09:26:09.070201Z"},"links":{"cited_paper":"/paper/2007.12035","citing_paper":"/paper/2510.15814"},"observation_digest":"sha256:d610538a89379b4a510028e1f070be809916c16898849b9f4355c3e565170f05","observation_id":"4ff2a05f-7f5c-4d3c-a81e-4722b87ff6fe","resolution":{"observed_at":"2026-08-04T09:26:09.070201Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2007.12035/citation-record","integrity":"/paper/2007.12035/integrity","json":"/paper/2007.12035/citation-record.json","paper":"/paper/2007.12035"},"outbound":[],"paper":{"arxiv_id":"2007.12035","last_updated":"2020-07-23T14:30:51Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-12T19:13:56.142644Z","submitted_at":"2020-07-23T14:30:51Z","title":"The expressive power of kth-order invariant graph networks"},"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-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"thesis":"As of 23 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2007.12035."}