{"as_of":"2026-08-12T07:17:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:818784bd5aaa5148ad6cb7d11b15566da966d976d8c6dcb118076277d579b95f","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-24T16:41:02.498569Z","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-05-24T16:44:41.824398Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1703.08291","last_updated":"2017-03-24T06:08:07Z","snapshot_observed_at":"2026-08-03T09:03:54.972040Z","submitted_at":"2017-03-24T06:08:07Z","title":"Projective divisible binary codes","version":1},"cited_work":{"arxiv_id":"1703.08291","doi":null,"metadata_source":"pith","pith_arxiv_id":"1703.08291","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Projective divisible binary codes","venue":"math.CO","work_id":"de103d3f-abe0-4d12-962b-ab55f6c97860","year":2017},"citing_paper":{"arxiv_id":"1907.10363","last_updated":"2019-07-24T11:02:23Z","snapshot_observed_at":"2026-08-04T13:18:21.742769Z","submitted_at":"2019-07-24T11:02:23Z","title":"Classification of linear codes using canonical augmentation","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-24T16:41:02.498569Z"},"links":{"cited_paper":"/paper/1703.08291","citing_paper":"/paper/1907.10363"},"observation_digest":"sha256:7b872b6dbcef738e0582fe2245e6ae2d84632a9b6de9118c1ee57cdb5fbfd480","observation_id":"5af10a41-1701-44af-9703-ed6c9f7a170c","resolution":{"observed_at":"2026-05-24T16:44:41.826541Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1703.08291","last_updated":"2017-03-24T06:08:07Z","snapshot_observed_at":"2026-08-03T09:03:54.972040Z","submitted_at":"2017-03-24T06:08:07Z","title":"Projective divisible binary codes","version":1},"cited_work":{"arxiv_id":"1703.08291","doi":null,"metadata_source":"pith","pith_arxiv_id":"1703.08291","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Projective divisible binary codes","venue":"math.CO","work_id":"de103d3f-abe0-4d12-962b-ab55f6c97860","year":2017},"citing_paper":{"arxiv_id":"2412.14615","last_updated":"2026-05-08T10:48:09Z","snapshot_observed_at":"2026-08-03T00:49:49.053802Z","submitted_at":"2024-12-19T08:04:34Z","title":"Additive codes attaining the Griesmer bound","version":3},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-05-23T07:42:02.626085Z"},"links":{"cited_paper":"/paper/1703.08291","citing_paper":"/paper/2412.14615"},"observation_digest":"sha256:fef6b67e36a3b2f665ac66aa886e03e046903c4de701e54545e8983cc2c3087f","observation_id":"ac5a9531-2037-413a-82a6-5e19c8bb44ab","resolution":{"observed_at":"2026-05-23T07:42:43.361901Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1703.08291/citation-record","integrity":"/paper/1703.08291/integrity","json":"/paper/1703.08291/citation-record.json","paper":"/paper/1703.08291"},"outbound":[],"paper":{"arxiv_id":"1703.08291","last_updated":"2017-03-24T06:08:07Z","latest_version":1,"primary_category":"math.CO","snapshot_observed_at":"2026-08-03T09:03:54.972040Z","submitted_at":"2017-03-24T06:08:07Z","title":"Projective divisible binary codes"},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:1703.08291."}