{"as_of":"2026-08-10T15:49:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:913fabb3753f4b29c15d75c9567e6a1a35c171db9591219b81e0d41480fd2896","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-10T06:31:04.303077+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-05-10T03:09:42.968897Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-11T12:41:05.074582Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1303.4375","last_updated":"2013-03-18T19:42:10Z","snapshot_observed_at":"2026-07-06T03:09:01.623028Z","submitted_at":"2013-03-18T19:42:10Z","title":"On the Computing of the Minimum Distance of Linear Block Codes by Heuristic Methods","version":1},"cited_work":{"arxiv_id":"1303.4375","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1303.4375","snapshot_observed_at":"2026-07-04T18:25:33.987746Z","title":null,"venue":null,"work_id":"58929a8b-bf5e-4d09-aa28-8ce71b8e53e8","year":2013},"citing_paper":{"arxiv_id":"2604.19712","last_updated":"2026-04-21T17:36:33Z","snapshot_observed_at":"2026-07-06T23:06:16.972438Z","submitted_at":"2026-04-21T17:36:33Z","title":"Ultrametric OGP - parametric RDT \\emph{symmetric} binary perceptron connection","version":1},"reference_index":90,"source":"pdf_text","source_observed_at":"2026-05-10T03:09:42.968897Z"},"links":{"cited_paper":"/paper/1303.4375","citing_paper":"/paper/2604.19712"},"observation_digest":"sha256:76c6bd86e1d8957a009de4b23a4cf6ff88a4f86cea7ff2f93f986824a472f759","observation_id":"9780a5eb-664f-454d-b7e0-26f48f976920","resolution":{"observed_at":"2026-07-04T18:25:33.987746Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1303.4375/citation-record","integrity":"/paper/1303.4375/integrity","json":"/paper/1303.4375/citation-record.json","paper":"/paper/1303.4375"},"outbound":[],"paper":{"arxiv_id":"1303.4375","last_updated":"2013-03-18T19:42:10Z","latest_version":1,"primary_category":"cs.IT","snapshot_observed_at":"2026-07-06T03:09:01.623028Z","submitted_at":"2013-03-18T19:42:10Z","title":"On the Computing of the Minimum Distance of Linear Block Codes by Heuristic Methods"},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1303.4375."}