{"as_of":"2026-08-07T17:51:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2d5f7ff12adece4c32cf9629ad43fa4490f40ee1ebccf520ccedcfa13a6d6b9b","coverage":[{"denominator":7,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":7,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T00:11:06.710276Z","state":"measured"},{"denominator":7,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":7,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2511.03388/citation-record","integrity":"/paper/2511.03388/integrity","json":"/paper/2511.03388/citation-record.json","paper":"/paper/2511.03388"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2505.22894","last_updated":"2025-05-28T21:56:54Z","snapshot_observed_at":"2026-08-07T16:21:59.465300Z","submitted_at":"2025-05-28T21:56:54Z","title":"Monotone Bounded-Depth Complexity of Homomorphism Polynomials","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.22894","snapshot_observed_at":"2026-08-04T00:11:05.712852Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2511.03388","last_updated":"2026-06-22T14:32:55Z","snapshot_observed_at":"2026-08-04T00:11:04.564465Z","submitted_at":"2025-11-05T11:48:09Z","title":"Monotone Bounded Depth Formula Complexity of Graph Homomorphism Polynomials","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-04T00:11:05.712852Z"},"links":{"cited_paper":"/paper/2505.22894","citing_paper":"/paper/2511.03388"},"observation_digest":"sha256:69df805e76864502337d4465ee803e4d97d29226969eefbbfe6eafbc573ebe5e","observation_id":"d55f8d98-9cfa-44cf-90e7-62cf87b220d9","resolution":{"observed_at":"2026-08-04T00:11:05.712852Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.fsttcs.2022.12","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Robustly Sepa- rating the Arithmetic Monotone Hierarchy via Graph Inner-Product","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","work_id":"76c38071-49b3-4b1f-a5f8-e1b8b479e002","year":2022},"citing_paper":{"arxiv_id":"2511.03388","last_updated":"2026-06-22T14:32:55Z","snapshot_observed_at":"2026-08-04T00:11:04.564465Z","submitted_at":"2025-11-05T11:48:09Z","title":"Monotone Bounded Depth Formula Complexity of Graph Homomorphism Polynomials","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-04T00:11:05.847599Z"},"links":{"citing_paper":"/paper/2511.03388"},"observation_digest":"sha256:486bafc9dbe0cc3c10bbe6aec5a9eb27474cbafba8fd1f56769e274c4a11d80b","observation_id":"9b55b91a-05ae-4207-9c36-66afb00893fa","resolution":{"observed_at":"2026-08-04T00:14:09.918849Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T00:11:06.027366Z","title":"Homomorphism Tensors and Linear Equations","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2511.03388","last_updated":"2026-06-22T14:32:55Z","snapshot_observed_at":"2026-08-04T00:11:04.564465Z","submitted_at":"2025-11-05T11:48:09Z","title":"Monotone Bounded Depth Formula Complexity of Graph Homomorphism Polynomials","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-04T00:11:06.027366Z"},"links":{"citing_paper":"/paper/2511.03388"},"observation_digest":"sha256:9338adec29daebc3608c16c0a9d501cf13c135957d52a75d16775a3f2134c164","observation_id":"f737f084-87a3-4058-b0f9-33da22cf1c4f","resolution":{"observed_at":"2026-08-04T00:11:06.027366Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T00:11:06.136653Z","title":"Completeness for VP and VNP from Graph Homomorphism","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2511.03388","last_updated":"2026-06-22T14:32:55Z","snapshot_observed_at":"2026-08-04T00:11:04.564465Z","submitted_at":"2025-11-05T11:48:09Z","title":"Monotone Bounded Depth Formula Complexity of Graph Homomorphism Polynomials","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-04T00:11:06.136653Z"},"links":{"citing_paper":"/paper/2511.03388"},"observation_digest":"sha256:7d3b8742acc45c553233ad023eaa2fd48907daa793140d7ea2216debbe335cc1","observation_id":"cd37836c-9551-4520-8db5-a98ae86ceb4d","resolution":{"observed_at":"2026-08-04T00:11:06.136653Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T00:11:06.373066Z","title":"Graph Homomorphism and Natural VNP-Complete Families","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2511.03388","last_updated":"2026-06-22T14:32:55Z","snapshot_observed_at":"2026-08-04T00:11:04.564465Z","submitted_at":"2025-11-05T11:48:09Z","title":"Monotone Bounded Depth Formula Complexity of Graph Homomorphism Polynomials","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-04T00:11:06.373066Z"},"links":{"citing_paper":"/paper/2511.03388"},"observation_digest":"sha256:de496c1d13ab34760f5dc2b3e2d8d71b53cb82783572b43b4f74af1552a77c19","observation_id":"7ea5b784-802e-4502-ac08-ba9f8dda30f8","resolution":{"observed_at":"2026-08-04T00:11:06.373066Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T00:11:06.543642Z","title":"On monotone formulae with restricted depth","venue":null,"work_id":null,"year":1984},"citing_paper":{"arxiv_id":"2511.03388","last_updated":"2026-06-22T14:32:55Z","snapshot_observed_at":"2026-08-04T00:11:04.564465Z","submitted_at":"2025-11-05T11:48:09Z","title":"Monotone Bounded Depth Formula Complexity of Graph Homomorphism Polynomials","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-04T00:11:06.543642Z"},"links":{"citing_paper":"/paper/2511.03388"},"observation_digest":"sha256:27c7f9271c487e75e324007c5279e0dfcaf57777376ed7b22a73cb8a328cd61c","observation_id":"48669a75-cc66-475d-92cf-01825cca6f2b","resolution":{"observed_at":"2026-08-04T00:11:06.543642Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T00:11:06.710276Z","title":"Monotone Arithmetic Com- plexity of Graph Homomorphism Polynomials","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2511.03388","last_updated":"2026-06-22T14:32:55Z","snapshot_observed_at":"2026-08-04T00:11:04.564465Z","submitted_at":"2025-11-05T11:48:09Z","title":"Monotone Bounded Depth Formula Complexity of Graph Homomorphism Polynomials","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-04T00:11:06.710276Z"},"links":{"citing_paper":"/paper/2511.03388"},"observation_digest":"sha256:198edfd4951d656472c955930ae297ef240b656505be2d0dc4cc2d759e22dc85","observation_id":"314c679c-6518-4f0b-a727-3b2ab6176a5e","resolution":{"observed_at":"2026-08-04T00:11:06.710276Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2511.03388","last_updated":"2026-06-22T14:32:55Z","latest_version":2,"primary_category":"cs.CC","snapshot_observed_at":"2026-08-04T00:11:04.564465Z","submitted_at":"2025-11-05T11:48:09Z","title":"Monotone Bounded Depth Formula Complexity of Graph Homomorphism Polynomials"},"reference_resolution":{"displayed":7,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":6,"verified_exact":1,"verified_fuzzy":0},"total_outbound_references":7},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 7 of 7 outbound references and 0 inbound Pith citation observations for arXiv:2511.03388."}