{"as_of":"2026-08-15T09:33:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d737ea3c980276752017cfc736abfb38451002476864a4db3ac408ff0a5b4c0a","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-15T06:32:42.880941+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-11T18:47:32.190436Z","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-12T00:16:22.474752Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1308.1351","last_updated":"2022-06-17T12:09:17Z","snapshot_observed_at":"2026-08-15T00:07:39.009706Z","submitted_at":"2013-08-06T17:08:50Z","title":"An $O^*(1.0821^n)$-Time Algorithm for Computing Maximum Independent Set in Graphs with Bounded Degree 3","version":4},"cited_work":{"arxiv_id":"1308.1351","doi":"10.48550/arxiv.1308.1351","metadata_source":"pith","pith_arxiv_id":"1308.1351","snapshot_observed_at":"2026-08-12T00:16:22.474752Z","title":"An $O^*(1.0821^n)$-Time Algorithm for Computing Maximum Independent Set in Graphs with Bounded Degree 3","venue":"cs.DS","work_id":"e268e72a-77d4-4ea9-8376-34ff6ef2f54e","year":2013},"citing_paper":{"arxiv_id":"2412.07685","last_updated":"2024-12-10T17:20:19Z","snapshot_observed_at":"2026-08-14T22:55:42.993877Z","submitted_at":"2024-12-10T17:20:19Z","title":"Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-11T18:47:32.190436Z"},"links":{"cited_paper":"/paper/1308.1351","citing_paper":"/paper/2412.07685"},"observation_digest":"sha256:ae0fc30152d70da40df199e29b422079a51ac99f50754e537739f893b3d6fe7d","observation_id":"cece0625-1db9-4b11-ae60-2c75d93c830c","resolution":{"observed_at":"2026-08-11T18:47:32.587071Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1308.1351/citation-record","integrity":"/paper/1308.1351/integrity","json":"/paper/1308.1351/citation-record.json","paper":"/paper/1308.1351"},"outbound":[],"paper":{"arxiv_id":"1308.1351","last_updated":"2022-06-17T12:09:17Z","latest_version":4,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-15T00:07:39.009706Z","submitted_at":"2013-08-06T17:08:50Z","title":"An $O^*(1.0821^n)$-Time Algorithm for Computing Maximum Independent Set in Graphs with Bounded Degree 3"},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1308.1351."}