{"as_of":"2026-08-08T18:18:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f93f00f8cdfb902079ddd6935c529fc4c64909137aa5ce203c8de08ef0a4a31f","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T10:30:39.317122Z","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-07T10:30:39.494809Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1302.4207","last_updated":"2013-02-18T10:12:29Z","snapshot_observed_at":"2026-07-06T03:06:38.805247Z","submitted_at":"2013-02-18T10:12:29Z","title":"A composition theorem for decision tree complexity","version":1},"cited_work":{"arxiv_id":"1302.4207","doi":null,"metadata_source":"pith","pith_arxiv_id":"1302.4207","snapshot_observed_at":"2026-08-07T10:30:39.494809Z","title":"A composition theorem for decision tree complexity","venue":"cs.CC","work_id":"84486643-7ed2-4195-8a8a-6446ce69eecd","year":2013},"citing_paper":{"arxiv_id":"2506.05187","last_updated":"2025-08-20T12:45:08Z","snapshot_observed_at":"2026-08-07T10:20:29.481426Z","submitted_at":"2025-06-05T16:00:36Z","title":"Classical and Quantum Query Complexity of Boolean Functions under Indefinite Causal Order","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-07T10:30:39.317122Z"},"links":{"cited_paper":"/paper/1302.4207","citing_paper":"/paper/2506.05187"},"observation_digest":"sha256:682b61716786ffebcf2560060d5c3ab5ea18dea7e3d25d46683d9d4f90279117","observation_id":"f4efd9f0-34e1-4e8f-8ee3-dd7fcb064497","resolution":{"observed_at":"2026-08-07T10:30:39.498457Z","resolver_source":"local_arxiv","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/1302.4207/citation-record","integrity":"/paper/1302.4207/integrity","json":"/paper/1302.4207/citation-record.json","paper":"/paper/1302.4207"},"outbound":[],"paper":{"arxiv_id":"1302.4207","last_updated":"2013-02-18T10:12:29Z","latest_version":1,"primary_category":"cs.CC","snapshot_observed_at":"2026-07-06T03:06:38.805247Z","submitted_at":"2013-02-18T10:12:29Z","title":"A composition theorem for decision tree complexity"},"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 1 inbound Pith citation observation for arXiv:1302.4207."}