{"as_of":"2026-08-08T09:05:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a4fabcab752c2a3f57a1d425c8a11860aab1aabeaad33183546a3ba838d531dc","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-07-10T06:05:38.945129Z","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-10T06:06:50.441094Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1104.2882","last_updated":"2011-04-14T19:32:10Z","snapshot_observed_at":"2026-07-06T02:26:20.993680Z","submitted_at":"2011-04-14T19:32:10Z","title":"Minimum Weight Cycles and Triangles: Equivalences and Algorithms","version":1},"cited_work":{"arxiv_id":"1104.2882","doi":null,"metadata_source":"pith","pith_arxiv_id":"1104.2882","snapshot_observed_at":"2026-07-10T06:06:50.441094Z","title":"Minimum Weight Cycles and Triangles: Equivalences and Algorithms","venue":"cs.DS","work_id":"cbddd371-738b-4858-adcc-b9b61b237292","year":2011},"citing_paper":{"arxiv_id":"2607.08517","last_updated":"2026-07-09T14:11:09Z","snapshot_observed_at":"2026-08-07T11:28:08.853622Z","submitted_at":"2026-07-09T14:11:09Z","title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-07-10T06:05:38.945129Z"},"links":{"cited_paper":"/paper/1104.2882","citing_paper":"/paper/2607.08517"},"observation_digest":"sha256:d8168be9c49ae82e515461e9b0647c49914c25b6191fd953f8521172d7df86a5","observation_id":"202dc4af-49a0-4ab3-9cd4-04d81770f404","resolution":{"observed_at":"2026-07-10T06:06:50.442494Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"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/1104.2882/citation-record","integrity":"/paper/1104.2882/integrity","json":"/paper/1104.2882/citation-record.json","paper":"/paper/1104.2882"},"outbound":[],"paper":{"arxiv_id":"1104.2882","last_updated":"2011-04-14T19:32:10Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-07-06T02:26:20.993680Z","submitted_at":"2011-04-14T19:32:10Z","title":"Minimum Weight Cycles and Triangles: Equivalences and Algorithms"},"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:1104.2882."}