{"as_of":"2026-08-14T10:05:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f004f0cfdc2d29799cb7bc92548280b808915dea6db870853d39ddf49321f45d","coverage":[{"denominator":44,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":44,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-02T06:24:54.175440Z","state":"measured"},{"denominator":44,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":44,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"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":[],"links":{"evidence":"/evidence","html":"/paper/2607.12870/citation-record","integrity":"/paper/2607.12870/integrity","json":"/paper/2607.12870/citation-record.json","paper":"/paper/2607.12870"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T06:24:49.993144Z","title":null,"venue":null,"work_id":null,"year":2023},"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":1,"source":"pdf_text","source_observed_at":"2026-08-02T06:24:49.993144Z"},"links":{"citing_paper":"/paper/2607.12870"},"observation_digest":"sha256:47d14f725cd91bb80b18c87b21de2b4e511950b0b40237947d7e452c3bf6227a","observation_id":"c45ab0dc-574b-43c0-ac2a-70072782ac50","resolution":{"observed_at":"2026-08-02T06:24:49.993144Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T06:24:50.082200Z","title":"Albrecht, Benjamin Benčina, and Russell W","venue":null,"work_id":null,"year":2025},"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":2,"source":"pdf_text","source_observed_at":"2026-08-02T06:24:50.082200Z"},"links":{"citing_paper":"/paper/2607.12870"},"observation_digest":"sha256:7211982f47bf9cc57291ed9d62b8fe7faf2851846482722730af0dd7c5a963ad","observation_id":"f41d5ce7-b329-4958-be4d-ddef329e87ab","resolution":{"observed_at":"2026-08-02T06:24:50.082200Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T06:24:50.148725Z","title":"Graph isomorphism in quasipolynomial time","venue":null,"work_id":null,"year":2016},"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":3,"source":"pdf_text","source_observed_at":"2026-08-02T06:24:50.148725Z"},"links":{"citing_paper":"/paper/2607.12870"},"observation_digest":"sha256:d9c24a0aa7606112f35a945a800a8636db20d63fc00a1152861550d28a2a83b2","observation_id":"40a62d48-3e15-42c3-91d8-326cf88ccf3a","resolution":{"observed_at":"2026-08-02T06:24:50.148725Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T06:24:50.241784Z","title":"Grochow, and Youming Qiao","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":4,"source":"pdf_text","source_observed_at":"2026-08-02T06:24:50.241784Z"},"links":{"citing_paper":"/paper/2607.12870"},"observation_digest":"sha256:f3ba9bd9d3ce508a02cefb7663d828e396ddf9915a8c5f671516c84377da6e8e","observation_id":"eb224dcb-b687-47bc-9cae-236ddf618e1a","resolution":{"observed_at":"2026-08-02T06:24:50.241784Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T06:24:50.293920Z","title":"SPECK: Signatures from Permu- tation Equivalence of Codes and Kernels.Cryptology ePrint Archive, 2025","venue":null,"work_id":null,"year":2025},"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":5,"source":"pdf_text","source_observed_at":"2026-08-02T06:24:50.293920Z"},"links":{"citing_paper":"/paper/2607.12870"},"observation_digest":"sha256:79495a5dd830655c509fff616fa4c3594f374c22e5c2251e6897b2c79fcc3ec3","observation_id":"8aadb79b-0993-4a4f-8579-23ca90ffe536","resolution":{"observed_at":"2026-08-02T06:24:50.293920Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T06:24:50.359202Z","title":"Solving the linear code equivalence problem from single code- word matching","venue":null,"work_id":null,"year":2026},"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":6,"source":"pdf_text","source_observed_at":"2026-08-02T06:24:50.359202Z"},"links":{"citing_paper":"/paper/2607.12870"},"observation_digest":"sha256:b2d9d183372ad317b518be251c0eda067eb9c2d83305d1f7f80eec2a51a11dd3","observation_id":"afac2cd2-2eae-4845-b802-96ff5464d0b1","resolution":{"observed_at":"2026-08-02T06:24:50.359202Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T06:24:50.391606Z","title":"Permutation code equivalence is not harder than graph isomorphism when hulls are trivial","venue":null,"work_id":null,"year":2019},"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":7,"source":"pdf_text","source_observed_at":"2026-08-02T06:24:50.391606Z"},"links":{"citing_paper":"/paper/2607.12870"},"observation_digest":"sha256:905c2b30b74a22a606b9534a6bc43ddd6e9fa997ac9be2a51bfba51c67c115b4","observation_id":"b62f57b7-9ba4-4d74-a761-4a813ec9f478","resolution":{"observed_at":"2026-08-02T06:24:50.391606Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T06:24:50.396171Z","title":"Advancedsignaturefunctionalitiesfromthecodeequiva- lence problem.International Journal of Computer Mathematics: Computer Systems Theory, 7(2):112–128, 2022","venue":null,"work_id":null,"year":2022},"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":8,"source":"pdf_text","source_observed_at":"2026-08-02T06:24:50.396171Z"},"links":{"citing_paper":"/paper/2607.12870"},"observation_digest":"sha256:6a6b38a40d75a589d575e51719234b87263a19933f010bda80bea942edd34365","observation_id":"f45ef048-5b61-4ecf-bcc7-8fc977540d18","resolution":{"observed_at":"2026-08-02T06:24:50.396171Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T06:24:50.532121Z","title":"On the computational hardness of the code equivalence problem in cryptography.Advances in Mathematics of Communications, 17(1):23–55, 2023","venue":null,"work_id":null,"year":2023},"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":9,"source":"pdf_text","source_observed_at":"2026-08-02T06:24:50.532121Z"},"links":{"citing_paper":"/paper/2607.12870"},"observation_digest":"sha256:5e9a1de3c9c6d6fa54581511bee82ff6543c1e5f4d20121e3dce6fc64813bc54","observation_id":"9f30a7ee-1866-4169-9b4c-fa10f06c7ad5","resolution":{"observed_at":"2026-08-02T06:24:50.532121Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T06:24:50.636995Z","title":"The power of power codes: New classes of easy instances for the linear equivalence problem, 2026","venue":null,"work_id":null,"year":2026},"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":10,"source":"pdf_text","source_observed_at":"2026-08-02T06:24:50.636995Z"},"links":{"citing_paper":"/paper/2607.12870"},"observation_digest":"sha256:8f6b8b450996aeaf2c269831541a0da113ec2fccfda85d5f18824a1173f5c224","observation_id":"6859e1d5-d9df-4270-b301-c421322fcdae","resolution":{"observed_at":"2026-08-02T06:24:50.636995Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T06:24:50.761301Z","title":"VOLE-in-the- Head Signatures Based on the Linear Code Equivalence Problem.Cryptol- ogy ePrint Archive, 2025","venue":null,"work_id":null,"year":2025},"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":11,"source":"pdf_text","source_observed_at":"2026-08-02T06:24:50.761301Z"},"links":{"citing_paper":"/paper/2607.12870"},"observation_digest":"sha256:bf936604ac6dc44f0c1871f6b67aa060be3a84e1ee1db8ea9624cd4b2f5c1259","observation_id":"e9573ce8-11b5-4fac-930e-9a2c5246d959","resolution":{"observed_at":"2026-08-02T06:24:50.761301Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T06:24:50.974211Z","title":"Using the Schur prod- uct to solve the code equivalence problem.ePrint, 2025","venue":null,"work_id":null,"year":2025},"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":12,"source":"pdf_text","source_observed_at":"2026-08-02T06:24:50.974211Z"},"links":{"citing_paper":"/paper/2607.12870"},"observation_digest":"sha256:e59eb717bb94c66e21fe4f488a0646fa9c3350676f274a93e3a9072d8a4331c5","observation_id":"ad978587-620d-4fc2-a110-28bb699ed962","resolution":{"observed_at":"2026-08-02T06:24:50.974211Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T06:24:51.122313Z","title":"Asymp- totic improvements to provable algorithms for the code equivalence prob- lem.IEEE Transactions on Information Theory, 72(2):1093–1108, 2025","venue":null,"work_id":null,"year":2025},"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":13,"source":"pdf_text","source_observed_at":"2026-08-02T06:24:51.122313Z"},"links":{"citing_paper":"/paper/2607.12870"},"observation_digest":"sha256:d245236070428a5cabfb52648b7545417ff260922532e384bcd66dfc3bceee7c","observation_id":"bec731d5-d649-406e-8ca1-41546b13e3a2","resolution":{"observed_at":"2026-08-02T06:24:51.122313Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T06:24:51.297158Z","title":"Relating code equivalence to other isomorphism problems.Designs, Codes and Cryptography, 93(3):701– 723, 2025","venue":null,"work_id":null,"year":2025},"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":14,"source":"pdf_text","source_observed_at":"2026-08-02T06:24:51.297158Z"},"links":{"citing_paper":"/paper/2607.12870"},"observation_digest":"sha256:19d6d61e91ff7b276171a746758374442379f45a3c6a8488c6de94af9be07eeb","observation_id":"08903126-566b-4436-8db4-898582f672f6","resolution":{"observed_at":"2026-08-02T06:24:51.297158Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T06:24:51.395552Z","title":"Not enough LESS: an improved algorithm for solving code equivalence problems overFq","venue":null,"work_id":null,"year":2020},"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":15,"source":"pdf_text","source_observed_at":"2026-08-02T06:24:51.395552Z"},"links":{"citing_paper":"/paper/2607.12870"},"observation_digest":"sha256:fba224ef211d28fd864f5577dec87708f1e6c2d7b9fadf12357148607356e471","observation_id":"76c47b57-6ef9-46b9-a6fa-59c3d8fc2225","resolution":{"observed_at":"2026-08-02T06:24:51.395552Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T06:24:51.552670Z","title":"A search-to-decision reduction for the permutation code equivalence problem","venue":null,"work_id":null,"year":2023},"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":16,"source":"pdf_text","source_observed_at":"2026-08-02T06:24:51.552670Z"},"links":{"citing_paper":"/paper/2607.12870"},"observation_digest":"sha256:d74087080eef08c58ef3ef7936aa65b7b215bcd9cd55758c1b3b822beaa867a6","observation_id":"4b828f78-ef57-4fc9-a498-9969569344f2","resolution":{"observed_at":"2026-08-02T06:24:51.552670Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T06:24:51.595564Z","title":"LESS is more: code-based signatures without syndromes","venue":null,"work_id":null,"year":2020},"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":17,"source":"pdf_text","source_observed_at":"2026-08-02T06:24:51.595564Z"},"links":{"citing_paper":"/paper/2607.12870"},"observation_digest":"sha256:8bf32f9042c6b47a34c510ced7788eafa342c28129261af650ba6cac8a79fc8f","observation_id":"30d0ee4e-bdaa-4364-bf92-e4ff378e2be0","resolution":{"observed_at":"2026-08-02T06:24:51.595564Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T06:24:51.654273Z","title":"Don’t use it twice! Solving relaxed linear equivalence problems","venue":null,"work_id":null,"year":null},"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":18,"source":"pdf_text","source_observed_at":"2026-08-02T06:24:51.654273Z"},"links":{"citing_paper":"/paper/2607.12870"},"observation_digest":"sha256:c31c4b1113ea65dd8f0bc5988a97f873e9afe8eabfa85d48e3e41c17d966a123","observation_id":"9b9aac16-4f63-4cef-a99c-d17cc1c66f33","resolution":{"observed_at":"2026-08-02T06:24:51.654273Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T06:24:51.719793Z","title":"Onepairtorulethemall: Anoptimal algorithm for solving code equivalence via codeword search.ePrint, 2026","venue":null,"work_id":null,"year":2026},"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":19,"source":"pdf_text","source_observed_at":"2026-08-02T06:24:51.719793Z"},"links":{"citing_paper":"/paper/2607.12870"},"observation_digest":"sha256:998f845721129426d0c51c04b5d21873c5e28cf19f442c514af800bbfc5e7e27","observation_id":"0e72939c-01e8-4c75-8cc0-5199e3c293e6","resolution":{"observed_at":"2026-08-02T06:24:51.719793Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T06:24:51.784342Z","title":"Two is all it takes: Asymptotic and concrete improvements for solving code equivalence.ePrint, 2025","venue":null,"work_id":null,"year":2025},"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":20,"source":"pdf_text","source_observed_at":"2026-08-02T06:24:51.784342Z"},"links":{"citing_paper":"/paper/2607.12870"},"observation_digest":"sha256:e6409476317d04e7918e03eefc52b62202b2b106fa2371a309234ff25001713c","observation_id":"5e944198-1e8e-4dd2-a636-e5ea3ea3cfb9","resolution":{"observed_at":"2026-08-02T06:24:51.784342Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T06:24:51.850714Z","title":"Linear codes overF q are equivalent to LCD codes forq >3","venue":null,"work_id":null,"year":2018},"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":21,"source":"pdf_text","source_observed_at":"2026-08-02T06:24:51.850714Z"},"links":{"citing_paper":"/paper/2607.12870"},"observation_digest":"sha256:8ba36fcaac8c4524ff223e2285b4c46ab362274e4696d239178d5e4cf30e3162","observation_id":"3d519b27-779e-48ea-9e31-4b820b2dc907","resolution":{"observed_at":"2026-08-02T06:24:51.850714Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T06:24:51.917659Z","title":"Reductions between code equivalence problems","venue":null,"work_id":null,"year":2025},"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":22,"source":"pdf_text","source_observed_at":"2026-08-02T06:24:51.917659Z"},"links":{"citing_paper":"/paper/2607.12870"},"observation_digest":"sha256:0437574d00867de36898206986262bade35b7d7a51723c27d12ba321fd7ca2ce","observation_id":"117522d1-c554-497c-a18a-7c9a1e753d40","resolution":{"observed_at":"2026-08-02T06:24:51.917659Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T06:24:51.996287Z","title":"On linear equivalence, canonical forms, and digital signatures.Designs, Codes and Cryptography, pages 1–43, 2025","venue":null,"work_id":null,"year":2025},"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":23,"source":"pdf_text","source_observed_at":"2026-08-02T06:24:51.996287Z"},"links":{"citing_paper":"/paper/2607.12870"},"observation_digest":"sha256:8c2c642e70a55cb22c8a306f294e5db620f23709979aaee876ed20b433baa62a","observation_id":"f3a60d67-781b-4342-8d27-51467aa435a0","resolution":{"observed_at":"2026-08-02T06:24:51.996287Z","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-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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T06:24:52.341519Z","title":"Hull attacks on the lattice isomorphism problem","venue":null,"work_id":null,"year":2023},"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":25,"source":"pdf_text","source_observed_at":"2026-08-02T06:24:52.341519Z"},"links":{"citing_paper":"/paper/2607.12870"},"observation_digest":"sha256:89d5603fa9d475e68a7641ad2e5e9fcbf5c6bf41a82bc1d6b4d17cbb09935a24","observation_id":"8a133f95-8cb7-4995-b214-0de6f84402ee","resolution":{"observed_at":"2026-08-02T06:24:52.341519Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T06:24:52.509947Z","title":"Monomial isomorphism for tensors and applica- tions to code equivalence problems.Designs, Codes and Cryptography, 92(7):1961–1982, 2024","venue":null,"work_id":null,"year":1961},"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":26,"source":"pdf_text","source_observed_at":"2026-08-02T06:24:52.509947Z"},"links":{"citing_paper":"/paper/2607.12870"},"observation_digest":"sha256:99b68fa7e06733d1d0f34a697ad79df00d71553d52f792cccb81ef6d19da1300","observation_id":"76213978-0900-4eb1-bb8d-6c2680bbd11f","resolution":{"observed_at":"2026-08-02T06:24:52.509947Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T06:24:52.544581Z","title":"On the hardness of the decoding and the minimum distance problems for rank codes.IEEE Transactions on Information Theory, 62(12):7245–7252, 2016","venue":null,"work_id":null,"year":2016},"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":27,"source":"pdf_text","source_observed_at":"2026-08-02T06:24:52.544581Z"},"links":{"citing_paper":"/paper/2607.12870"},"observation_digest":"sha256:8d338a8acaa6917791ba05d3ed34f305ffee8bdeded44a1728cdcdf80eccf812","observation_id":"4c530582-75d6-47b2-b2e7-d7c42db9d7e3","resolution":{"observed_at":"2026-08-02T06:24:52.544581Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T06:24:52.632380Z","title":"Complexity of finding automorphism group of code","venue":null,"work_id":null,"year":2020},"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":28,"source":"pdf_text","source_observed_at":"2026-08-02T06:24:52.632380Z"},"links":{"citing_paper":"/paper/2607.12870"},"observation_digest":"sha256:7354d077ca7259e63be3988f3d4e8974d3acde18301b889f290940541443974a","observation_id":"54f27ea5-c52e-41d1-bacc-d98f2a0be479","resolution":{"observed_at":"2026-08-02T06:24:52.632380Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T06:24:52.713771Z","title":"Matrix isomorphism of matrix lie algebras","venue":null,"work_id":null,"year":2012},"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":29,"source":"pdf_text","source_observed_at":"2026-08-02T06:24:52.713771Z"},"links":{"citing_paper":"/paper/2607.12870"},"observation_digest":"sha256:90167986465257c46fb2c0673a96857a05bdb60113ceecd18ed01b5050580918","observation_id":"784dc5f4-b13b-46e7-90a1-b80a3caaff32","resolution":{"observed_at":"2026-08-02T06:24:52.713771Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T06:24:52.806588Z","title":"On the complexity of isomorphism problems for tensors, groups, and polynomials i: tensor isomorphism- completeness.SIAM Journal on Computing, 52(2):568–617, 2023","venue":null,"work_id":null,"year":2023},"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":30,"source":"pdf_text","source_observed_at":"2026-08-02T06:24:52.806588Z"},"links":{"citing_paper":"/paper/2607.12870"},"observation_digest":"sha256:48d25e75dfa28091ab190fd542ad6e03b88f515eb3e6abd75b0e473bc309b799","observation_id":"870fc566-c9e6-4e8c-aa8a-a0b5cbb1c959","resolution":{"observed_at":"2026-08-02T06:24:52.806588Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T06:24:52.882495Z","title":"Tanuki: New Frameworks for (Concurrently Se- cure)BlindSignaturesfromPost-QuantumGroupActions","venue":null,"work_id":null,"year":2025},"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":31,"source":"pdf_text","source_observed_at":"2026-08-02T06:24:52.882495Z"},"links":{"citing_paper":"/paper/2607.12870"},"observation_digest":"sha256:86cb980f562563f8d661923783dca5d147460f5f0fa94ba394ce3abaf8bda6fa","observation_id":"23f14cb7-3811-4ee8-8d13-a06d23c7fda6","resolution":{"observed_at":"2026-08-02T06:24:52.882495Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T06:24:52.980610Z","title":"Springer, 2006","venue":null,"work_id":null,"year":2006},"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":32,"source":"pdf_text","source_observed_at":"2026-08-02T06:24:52.980610Z"},"links":{"citing_paper":"/paper/2607.12870"},"observation_digest":"sha256:fca67486078e6ed763054b7717dc21c7997140cc602ccca8d6db8e1b4f9263b0","observation_id":"203ddb20-9100-4853-80ea-381bb06d426c","resolution":{"observed_at":"2026-08-02T06:24:52.980610Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T06:24:53.118791Z","title":"Code equivalence, point set equivalence, and polynomial isomorphism.arXiv:2511.06843, 2025","venue":null,"work_id":null,"year":2025},"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":33,"source":"pdf_text","source_observed_at":"2026-08-02T06:24:53.118791Z"},"links":{"citing_paper":"/paper/2607.12870"},"observation_digest":"sha256:02ab60f9b6c60fee34fd2c5bb438a6acbc48d628f9d44cd394a728c56907459c","observation_id":"734237fb-330e-4f1d-af70-76b194219432","resolution":{"observed_at":"2026-08-02T06:24:53.118791Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T06:24:53.205508Z","title":"Rigid linear binary codes.Journal of Combinatorial Theory, Series A, 63(1):110–128, 1993","venue":null,"work_id":null,"year":1993},"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":34,"source":"pdf_text","source_observed_at":"2026-08-02T06:24:53.205508Z"},"links":{"citing_paper":"/paper/2607.12870"},"observation_digest":"sha256:cbadb40bafca6bc02ec43f8cb41a9afbdd3b3a9ef8d5d54795508ecc63079728","observation_id":"0943280b-e317-487e-8e8a-0136e73b597e","resolution":{"observed_at":"2026-08-02T06:24:53.205508Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T06:24:53.324784Z","title":"Computing automorphism groups of error-correcting codes","venue":null,"work_id":null,"year":1982},"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":35,"source":"pdf_text","source_observed_at":"2026-08-02T06:24:53.324784Z"},"links":{"citing_paper":"/paper/2607.12870"},"observation_digest":"sha256:7960e5eab235e2edbc884ddc81d9b9e3356eadd6737a979d2699b935cc8646bf","observation_id":"aa14c374-1298-466e-bd9d-87c9658b2321","resolution":{"observed_at":"2026-08-02T06:24:53.324784Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T06:24:53.385734Z","title":"A note on the graph isomorphism counting problem.Inf","venue":null,"work_id":null,"year":1979},"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":36,"source":"pdf_text","source_observed_at":"2026-08-02T06:24:53.385734Z"},"links":{"citing_paper":"/paper/2607.12870"},"observation_digest":"sha256:25f62b5ad58cea9f09867d506d8c9e9ee8281073a2b57974e24fef6d4233f9e6","observation_id":"564099eb-7aa7-42e7-a8d5-a6b27d1aa69d","resolution":{"observed_at":"2026-08-02T06:24:53.385734Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T06:24:53.486758Z","title":"An improved algorithm for code equivalence","venue":null,"work_id":null,"year":2025},"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":37,"source":"pdf_text","source_observed_at":"2026-08-02T06:24:53.486758Z"},"links":{"citing_paper":"/paper/2607.12870"},"observation_digest":"sha256:3b5ecf77c4c94b6359b76fd8f5fe64273a5461624b10a6fb017237924fbfa41c","observation_id":"f768f7cd-d41e-4a34-8110-cbe391fff2d4","resolution":{"observed_at":"2026-08-02T06:24:53.486758Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T06:24:53.574577Z","title":"Codes, cryptology and curves with computer algebra, volume 1","venue":null,"work_id":null,"year":2017},"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":38,"source":"pdf_text","source_observed_at":"2026-08-02T06:24:53.574577Z"},"links":{"citing_paper":"/paper/2607.12870"},"observation_digest":"sha256:e58eb3bee2f7588b44a632bd51d85385db40045d9a4fe5c578beb279d54ec85d","observation_id":"f12822aa-93cc-41df-83f6-f0b6c1580cf8","resolution":{"observed_at":"2026-08-02T06:24:53.574577Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T06:24:53.660321Z","title":"Is code equivalence easy to decide?IEEE Transactions on Information Theory, 43(5):1602–1604, 1997","venue":null,"work_id":null,"year":1997},"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":39,"source":"pdf_text","source_observed_at":"2026-08-02T06:24:53.660321Z"},"links":{"citing_paper":"/paper/2607.12870"},"observation_digest":"sha256:225dabd75af513ccf5153c95f490bb670af70e4da9e46ec0b4f61eaec449a133","observation_id":"07da175b-5052-47c6-90a4-18bfd9400649","resolution":{"observed_at":"2026-08-02T06:24:53.660321Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T06:24:53.746451Z","title":"PhD thesis, Normandie Université; University of Khartoum, 2017","venue":null,"work_id":null,"year":2017},"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":40,"source":"pdf_text","source_observed_at":"2026-08-02T06:24:53.746451Z"},"links":{"citing_paper":"/paper/2607.12870"},"observation_digest":"sha256:22ea1d365ee0e6d55b0bb09b7631e6e1a28395dd45144991f60bc70618adf668","observation_id":"d443a58f-d463-49c2-992e-80d8791b4e1b","resolution":{"observed_at":"2026-08-02T06:24:53.746451Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T06:24:53.824549Z","title":"Computational hard- ness of the permuted kernel and subcode equivalence problems.IEEE Transactions on Information Theory, 2023","venue":null,"work_id":null,"year":2023},"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":41,"source":"pdf_text","source_observed_at":"2026-08-02T06:24:53.824549Z"},"links":{"citing_paper":"/paper/2607.12870"},"observation_digest":"sha256:b4c343f86e6dbe4d77740a3556765556b05625836d282f61d815ed1ea9eb9cdc","observation_id":"a4de58e5-1f73-4062-a3cb-e25aa6c4f57c","resolution":{"observed_at":"2026-08-02T06:24:53.824549Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T06:24:53.900807Z","title":"Finding the permutation between equivalent linear codes: The support splitting algorithm.IEEE Transactions on Information The- ory, 46(4):1193–1203, 2000","venue":null,"work_id":null,"year":2000},"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":42,"source":"pdf_text","source_observed_at":"2026-08-02T06:24:53.900807Z"},"links":{"citing_paper":"/paper/2607.12870"},"observation_digest":"sha256:8317ef59347748b683dad4b498fd636eacdf33896e6559f67167e1def58aa3f0","observation_id":"11d06b21-1f54-48e3-902c-26deabec5611","resolution":{"observed_at":"2026-08-02T06:24:53.900807Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T06:24:54.026726Z","title":"The hardness of code equivalence overF q and its application to code-based cryptography","venue":null,"work_id":null,"year":2013},"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":43,"source":"pdf_text","source_observed_at":"2026-08-02T06:24:54.026726Z"},"links":{"citing_paper":"/paper/2607.12870"},"observation_digest":"sha256:68e0ffc449ffc298eca38dd4fdbd43886f18d743181707ab7dce2977f8a6de37","observation_id":"b52b1703-d037-492a-8a36-9dc5bc19698a","resolution":{"observed_at":"2026-08-02T06:24:54.026726Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T06:24:54.175440Z","title":"How easy is code equivalence over Fq? InInternational Workshop on Coding and Cryptography-WCC 2013, 2013","venue":null,"work_id":null,"year":2013},"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":44,"source":"pdf_text","source_observed_at":"2026-08-02T06:24:54.175440Z"},"links":{"citing_paper":"/paper/2607.12870"},"observation_digest":"sha256:abd5b2c0374733e46a95db88c4e48014881eda1fdb264b3afde63124de70ee86","observation_id":"1e8381c9-9a8b-4fda-9241-2e660c8e5e8e","resolution":{"observed_at":"2026-08-02T06:24:54.175440Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.12870","last_updated":"2026-07-15T06:49:40Z","latest_version":2,"primary_category":"cs.IT","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"},"reference_resolution":{"displayed":44,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":44,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":44},"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 44 of 44 outbound references and 0 inbound Pith citation observations for arXiv:2607.12870."}