{"as_of":"2026-08-07T23:08:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e97efc7c94d126fd38f985d69e30e8377d75eb26b5e862b792f70d817c2277f6","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-07T06:34:17.273281+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-14T17:45:25.949294Z","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":[{"citation":{"cited_paper":{"arxiv_id":"1305.6187","last_updated":"2013-07-23T14:42:15Z","snapshot_observed_at":"2026-07-06T03:14:22.508667Z","submitted_at":"2013-05-27T11:57:40Z","title":"Improved Branch-and-Bound for Low Autocorrelation Binary Sequences","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1305.6187","snapshot_observed_at":"2026-07-14T17:45:25.949294Z","title":"Improved branch-and-bound for low autocorrelation binary sequences.arXiv preprint arXiv:1305.6187, 2013","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.09688","last_updated":"2026-06-17T09:17:04Z","snapshot_observed_at":"2026-08-01T11:37:12.112786Z","submitted_at":"2026-06-17T09:17:04Z","title":"Prioritizing Search Space Regions in the Low Autocorrelation Binary Sequences Problem","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-07-14T17:45:25.949294Z"},"links":{"cited_paper":"/paper/1305.6187","citing_paper":"/paper/2607.09688"},"observation_digest":"sha256:a73d02061b1bf4e81b876a31fd0a8a88ed9da1cb533e16431259a226b8af28e9","observation_id":"9f46492b-a283-4cc2-8b41-e18b3bdee13b","resolution":{"observed_at":"2026-07-14T17:45:25.949294Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1305.6187/citation-record","integrity":"/paper/1305.6187/integrity","json":"/paper/1305.6187/citation-record.json","paper":"/paper/1305.6187"},"outbound":[],"paper":{"arxiv_id":"1305.6187","last_updated":"2013-07-23T14:42:15Z","latest_version":2,"primary_category":"cs.AI","snapshot_observed_at":"2026-07-06T03:14:22.508667Z","submitted_at":"2013-05-27T11:57:40Z","title":"Improved Branch-and-Bound for Low Autocorrelation Binary Sequences"},"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-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 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1305.6187."}