{"as_of":"2026-08-14T08:42:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:15bb2a618a49d55c3e860006564c4af24b07cf409a178a6dea12cd6aac60b6c1","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T21:00:13.998239Z","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-25T03:56:36.482741Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2011.04611","last_updated":"2021-06-10T13:38:53Z","snapshot_observed_at":"2026-08-14T03:00:34.946168Z","submitted_at":"2020-11-09T18:14:03Z","title":"On the hardness of code equivalence problems in rank metric","version":2},"cited_work":{"arxiv_id":"2011.04611","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2011.04611","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Couvreur, T","venue":null,"work_id":"01b378fb-72dc-4517-85f6-a4bc9d773e8d","year":2011},"citing_paper":{"arxiv_id":"2605.23681","last_updated":"2026-05-22T14:30:18Z","snapshot_observed_at":"2026-08-01T15:25:40.011612Z","submitted_at":"2026-05-22T14:30:18Z","title":"New invariants for rank metric codes, with applications to the classification of rank two semifields of order 256","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-25T03:55:56.878631Z"},"links":{"cited_paper":"/paper/2011.04611","citing_paper":"/paper/2605.23681"},"observation_digest":"sha256:02e76f4d4029f8b36477e0071c5c7a140a2f094c8ac7377a34b0db2e12017ff5","observation_id":"2caa03eb-3141-4a51-ae40-e050a837e4bc","resolution":{"observed_at":"2026-05-25T03:56:36.485229Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2011.04611","last_updated":"2021-06-10T13:38:53Z","snapshot_observed_at":"2026-08-14T03:00:34.946168Z","submitted_at":"2020-11-09T18:14:03Z","title":"On the hardness of code equivalence problems in rank metric","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2011.04611","snapshot_observed_at":"2026-08-02T06:24:52.207723Z","title":"On the hardness of code equivalence problems in rank metric.arXiv:2011.04611, 2020","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.12870","last_updated":"2026-07-15T06:49:40Z","snapshot_observed_at":"2026-08-02T19:54:20.908497Z","submitted_at":"2026-07-14T15:21:22Z","title":"A Survey on Code Equivalence: The State-of-the-Art and Open Questions","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-02T06:24:52.207723Z"},"links":{"cited_paper":"/paper/2011.04611","citing_paper":"/paper/2607.12870"},"observation_digest":"sha256:9abfde4da5861831024650a37d6d7c62719c9df9ddb51bf9435c0802be2344c7","observation_id":"cb6681eb-8c00-44ad-bf2c-4235f770155a","resolution":{"observed_at":"2026-08-02T06:24:52.207723Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2011.04611","last_updated":"2021-06-10T13:38:53Z","snapshot_observed_at":"2026-08-14T03:00:34.946168Z","submitted_at":"2020-11-09T18:14:03Z","title":"On the hardness of code equivalence problems in rank metric","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2011.04611","snapshot_observed_at":"2026-08-05T21:00:13.998239Z","title":"arXiv preprint arXiv:2011.04611 (2020)","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2608.03328","last_updated":"2026-08-04T08:38:48Z","snapshot_observed_at":"2026-08-12T11:17:26.591636Z","submitted_at":"2026-08-04T08:38:48Z","title":"Breaking ACDGV MinRank Gabidulin encryption schemes over matrix codes","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-05T21:00:13.998239Z"},"links":{"cited_paper":"/paper/2011.04611","citing_paper":"/paper/2608.03328"},"observation_digest":"sha256:32326ff0033362b7a10f9cd8308ea5c155ae9cefce382eb6bdfb3d43049ce289","observation_id":"df1c7d9e-1037-462c-ac8f-43073ad0442a","resolution":{"observed_at":"2026-08-05T21:00:13.998239Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2011.04611/citation-record","integrity":"/paper/2011.04611/integrity","json":"/paper/2011.04611/citation-record.json","paper":"/paper/2011.04611"},"outbound":[],"paper":{"arxiv_id":"2011.04611","last_updated":"2021-06-10T13:38:53Z","latest_version":2,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-14T03:00:34.946168Z","submitted_at":"2020-11-09T18:14:03Z","title":"On the hardness of code equivalence problems in rank metric"},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2011.04611."}