{"as_of":"2026-08-19T00:39:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8f7fc98e9ded4f70657c8889a95174b93693a8cc9cf5c4f6248353ce77a0b736","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":5,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":5,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+00:00","state":"measured"},{"denominator":5,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":5,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T18:42:26.753303Z","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-08-15T00:24:46.759640Z","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":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1303.4375","snapshot_observed_at":"2026-08-11T00:14:23.064423Z","title":null,"venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2412.19677","last_updated":"2024-12-27T14:57:40Z","snapshot_observed_at":"2026-08-16T19:29:59.997953Z","submitted_at":"2024-12-27T14:57:40Z","title":"Deep ReLU networks -- injectivity capacity upper bounds","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-11T00:14:23.064423Z"},"links":{"cited_paper":"/paper/1303.4375","citing_paper":"/paper/2412.19677"},"observation_digest":"sha256:89c09d25d9da339b2a2cfa165cae4d44dcd5e26d4fb83b70572f8d38558359d8","observation_id":"04ca195f-ad4f-4099-a478-0c7ba24d793e","resolution":{"observed_at":"2026-08-11T00:14:23.064423Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1303.4375","last_updated":"2013-03-18T19:42:10Z","snapshot_observed_at":"2026-08-15T00:24:46.759640Z","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":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1303.4375","snapshot_observed_at":"2026-08-15T18:39:35.726594Z","title":null,"venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2506.19272","last_updated":"2025-06-24T03:06:17Z","snapshot_observed_at":"2026-08-15T18:31:46.713446Z","submitted_at":"2025-06-24T03:06:17Z","title":"Fully lifted \\emph{blirp} interpolation -- a large deviation view","version":1},"reference_index":95,"source":"pdf_text","source_observed_at":"2026-08-15T18:39:35.726594Z"},"links":{"cited_paper":"/paper/1303.4375","citing_paper":"/paper/2506.19272"},"observation_digest":"sha256:6bed6ab881b8360246d5608ad5090ee0a37fdef64ed253b97334a4f2bab3f582","observation_id":"79ec0164-f6ae-44ec-8f9b-187f4f701d65","resolution":{"observed_at":"2026-08-15T18:39:35.726594Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1303.4375","last_updated":"2013-03-18T19:42:10Z","snapshot_observed_at":"2026-08-15T00:24:46.759640Z","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":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1303.4375","snapshot_observed_at":"2026-08-15T18:39:20.168385Z","title":null,"venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2506.19273","last_updated":"2025-06-24T03:08:14Z","snapshot_observed_at":"2026-08-15T18:31:45.528318Z","submitted_at":"2025-06-24T03:08:14Z","title":"A large deviation view of \\emph{stationarized} fully lifted blirp interpolation","version":1},"reference_index":96,"source":"pdf_text","source_observed_at":"2026-08-15T18:39:20.168385Z"},"links":{"cited_paper":"/paper/1303.4375","citing_paper":"/paper/2506.19273"},"observation_digest":"sha256:d1198c7f7298fb8642035fd2254915883712a67ddc79e458a30112176917b573","observation_id":"3269a00b-fc5c-4113-ba5f-78b1353f99f5","resolution":{"observed_at":"2026-08-15T18:39:20.168385Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1303.4375","last_updated":"2013-03-18T19:42:10Z","snapshot_observed_at":"2026-08-15T00:24:46.759640Z","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":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1303.4375","snapshot_observed_at":"2026-08-15T18:42:26.753303Z","title":null,"venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2506.19276","last_updated":"2025-06-24T03:12:39Z","snapshot_observed_at":"2026-08-16T00:45:44.954746Z","submitted_at":"2025-06-24T03:12:39Z","title":"Rare dense solutions clusters in asymmetric binary perceptrons -- local entropy via fully lifted RDT","version":1},"reference_index":84,"source":"pdf_text","source_observed_at":"2026-08-15T18:42:26.753303Z"},"links":{"cited_paper":"/paper/1303.4375","citing_paper":"/paper/2506.19276"},"observation_digest":"sha256:12c66dfeb18073aa501c816d6bedd29f0a07ad22cf68fa11c675601d02730323","observation_id":"9efda6df-c03e-4cf1-bf30-475b0d8a9f50","resolution":{"observed_at":"2026-08-15T18:42:26.753303Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1303.4375","last_updated":"2013-03-18T19:42:10Z","snapshot_observed_at":"2026-08-15T00:24:46.759640Z","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:acda89aab526d698ba00397a39b3197a2ddd682e62003e80082fcfc63632375c","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-08-15T00:24:46.759640Z","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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:1303.4375."}