{"as_of":"2026-08-20T10:33:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:53e88f91c830ec4bc40de569dbc9cf9f6d24cfd1523232cfe92151595e8ca853","coverage":[{"denominator":43,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":43,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T21:09:54.614218Z","state":"measured"},{"denominator":43,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":43,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-20T06:33:59.587034+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/2511.17236/citation-record","integrity":"/paper/2511.17236/integrity","json":"/paper/2511.17236/citation-record.json","paper":"/paper/2511.17236"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T21:09:49.408979Z","title":"On decoding by error location and dependent sets of error positions,","venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"2511.17236","last_updated":"2026-06-25T09:12:00Z","snapshot_observed_at":"2026-08-18T03:45:10.450701Z","submitted_at":"2025-11-21T13:27:16Z","title":"The Star Product of Uniformly Random Codes","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-03T21:09:49.408979Z"},"links":{"citing_paper":"/paper/2511.17236"},"observation_digest":"sha256:426ef3d4f368c3eff3136622d52bcb9aeab75a6f7bc3195c3308ec186bb39654","observation_id":"e196aa23-10ec-4892-9655-852fb218ff6c","resolution":{"observed_at":"2026-08-03T21:09:49.408979Z","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-03T21:09:49.465738Z","title":"Classical coding prob- lem from transversal T gates,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2511.17236","last_updated":"2026-06-25T09:12:00Z","snapshot_observed_at":"2026-08-18T03:45:10.450701Z","submitted_at":"2025-11-21T13:27:16Z","title":"The Star Product of Uniformly Random Codes","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-03T21:09:49.465738Z"},"links":{"citing_paper":"/paper/2511.17236"},"observation_digest":"sha256:db7c78fc3018c889d53de5ed1e1d5a63908304ec72a8373e848344b1cbd9fbc9","observation_id":"8f7b2634-ee97-47c1-9623-0228dadcc981","resolution":{"observed_at":"2026-08-03T21:09:49.465738Z","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-03T21:09:49.526658Z","title":"On optimality of CSS codes for transversal T,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2511.17236","last_updated":"2026-06-25T09:12:00Z","snapshot_observed_at":"2026-08-18T03:45:10.450701Z","submitted_at":"2025-11-21T13:27:16Z","title":"The Star Product of Uniformly Random Codes","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-03T21:09:49.526658Z"},"links":{"citing_paper":"/paper/2511.17236"},"observation_digest":"sha256:f1a5297cb2460f9d594a0d8f67a2945502400c035ee3be590cbfd7e1ddec56bf","observation_id":"fd0818c9-cd5a-4d7b-850e-92685140f50e","resolution":{"observed_at":"2026-08-03T21:09:49.526658Z","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-03T21:09:49.588380Z","title":"The Schur product of evalua- tion codes and its application to CSS-T quantum codes and private information retrieval,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2511.17236","last_updated":"2026-06-25T09:12:00Z","snapshot_observed_at":"2026-08-18T03:45:10.450701Z","submitted_at":"2025-11-21T13:27:16Z","title":"The Star Product of Uniformly Random Codes","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-03T21:09:49.588380Z"},"links":{"citing_paper":"/paper/2511.17236"},"observation_digest":"sha256:f92ce3ecf7c37abf5825f4d55cbb191b55262cfd00dee3ef5c9a0d01abf84ba2","observation_id":"1011f034-978e-48c3-aae3-1839b05c4cf1","resolution":{"observed_at":"2026-08-03T21:09:49.588380Z","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-03T21:09:49.640001Z","title":"An algebraic characterization of binary CSS-T codes and cyclic CSS-T codes for quantum fault tolerance,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2511.17236","last_updated":"2026-06-25T09:12:00Z","snapshot_observed_at":"2026-08-18T03:45:10.450701Z","submitted_at":"2025-11-21T13:27:16Z","title":"The Star Product of Uniformly Random Codes","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-03T21:09:49.640001Z"},"links":{"citing_paper":"/paper/2511.17236"},"observation_digest":"sha256:bca487fa9bee1d56b161167452f61b0777e21086ad55139ce51026dcb73baf72","observation_id":"d6cd4a54-80cd-4ac7-9418-867a9c640317","resolution":{"observed_at":"2026-08-03T21:09:49.640001Z","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-03T21:09:49.691700Z","title":"Private information retrieval from coded databases with colluding servers,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2511.17236","last_updated":"2026-06-25T09:12:00Z","snapshot_observed_at":"2026-08-18T03:45:10.450701Z","submitted_at":"2025-11-21T13:27:16Z","title":"The Star Product of Uniformly Random Codes","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-03T21:09:49.691700Z"},"links":{"citing_paper":"/paper/2511.17236"},"observation_digest":"sha256:27fe27b066f21c0c6770070aa14aa81ecc77700402d6d5dbacfcbc91567db33d","observation_id":"7ac6783f-54e0-4b89-9ba3-538c77ff466c","resolution":{"observed_at":"2026-08-03T21:09:49.691700Z","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-03T21:09:49.751718Z","title":"General framework for linear secure distributed ma- trix multiplication with Byzantine servers,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2511.17236","last_updated":"2026-06-25T09:12:00Z","snapshot_observed_at":"2026-08-18T03:45:10.450701Z","submitted_at":"2025-11-21T13:27:16Z","title":"The Star Product of Uniformly Random Codes","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-03T21:09:49.751718Z"},"links":{"citing_paper":"/paper/2511.17236"},"observation_digest":"sha256:92a96bff783176cba7575dec7c20676758ea692afb7d1e87ce80657bb235738c","observation_id":"6d821f90-420d-40f2-8c99-2ecaced56f7c","resolution":{"observed_at":"2026-08-03T21:09:49.751718Z","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-03T21:09:49.812256Z","title":"General secure multi-party computation from any linear secret-sharing scheme,","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2511.17236","last_updated":"2026-06-25T09:12:00Z","snapshot_observed_at":"2026-08-18T03:45:10.450701Z","submitted_at":"2025-11-21T13:27:16Z","title":"The Star Product of Uniformly Random Codes","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-03T21:09:49.812256Z"},"links":{"citing_paper":"/paper/2511.17236"},"observation_digest":"sha256:518e64d71a1d3021ad0cf79b846f8882524f3a206203d456b60a38c8217331f9","observation_id":"3e41a170-9ea4-4241-8522-9497ccb22d68","resolution":{"observed_at":"2026-08-03T21:09:49.812256Z","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-03T21:09:49.876309Z","title":"Cramer, I","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2511.17236","last_updated":"2026-06-25T09:12:00Z","snapshot_observed_at":"2026-08-18T03:45:10.450701Z","submitted_at":"2025-11-21T13:27:16Z","title":"The Star Product of Uniformly Random Codes","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-03T21:09:49.876309Z"},"links":{"citing_paper":"/paper/2511.17236"},"observation_digest":"sha256:f1a20fb7d0e716552abfc97a669b5f9b802303a1680768ec2d7a9cb7670d0ca5","observation_id":"0d71be74-ec52-44ce-9c3f-0124a1141073","resolution":{"observed_at":"2026-08-03T21:09:49.876309Z","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-03T21:09:49.943279Z","title":"Repairing Reed-Solomon codes,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2511.17236","last_updated":"2026-06-25T09:12:00Z","snapshot_observed_at":"2026-08-18T03:45:10.450701Z","submitted_at":"2025-11-21T13:27:16Z","title":"The Star Product of Uniformly Random Codes","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-03T21:09:49.943279Z"},"links":{"citing_paper":"/paper/2511.17236"},"observation_digest":"sha256:a19346bf73272fe7588f32b72423325978b323bf171791cf80baeb7211fb7877","observation_id":"be1b9035-0fcb-4f03-97d9-329e80b508d8","resolution":{"observed_at":"2026-08-03T21:09:49.943279Z","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-03T21:09:50.030731Z","title":"Erasures repair for decreasing monomial- Cartesian and augmented Reed-Muller codes of high rate,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2511.17236","last_updated":"2026-06-25T09:12:00Z","snapshot_observed_at":"2026-08-18T03:45:10.450701Z","submitted_at":"2025-11-21T13:27:16Z","title":"The Star Product of Uniformly Random Codes","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-03T21:09:50.030731Z"},"links":{"citing_paper":"/paper/2511.17236"},"observation_digest":"sha256:346532ccdce720457c0bb3187bea2f7d23aa6736a9eef7fb2290f70091ca361a","observation_id":"bd3a2cb0-15d3-4546-b45d-d1a14724e59f","resolution":{"observed_at":"2026-08-03T21:09:50.030731Z","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-03T21:09:50.110613Z","title":"Distinguisher-based attacks on public-key cryptosystems using Reed-Solomon codes,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2511.17236","last_updated":"2026-06-25T09:12:00Z","snapshot_observed_at":"2026-08-18T03:45:10.450701Z","submitted_at":"2025-11-21T13:27:16Z","title":"The Star Product of Uniformly Random Codes","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-03T21:09:50.110613Z"},"links":{"citing_paper":"/paper/2511.17236"},"observation_digest":"sha256:ba6fbeb4b7ed05e65db33f51f2f44883723f8d3c12339474450193555c4e79f1","observation_id":"be7b2d63-c133-46e7-ba50-0ab70fa2b9ab","resolution":{"observed_at":"2026-08-03T21:09:50.110613Z","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-03T21:09:50.189217Z","title":"Distinguishing and recovering generalized linearized Reed–Solomon codes,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2511.17236","last_updated":"2026-06-25T09:12:00Z","snapshot_observed_at":"2026-08-18T03:45:10.450701Z","submitted_at":"2025-11-21T13:27:16Z","title":"The Star Product of Uniformly Random Codes","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-03T21:09:50.189217Z"},"links":{"citing_paper":"/paper/2511.17236"},"observation_digest":"sha256:2b7aaa6fadf21b7d976f72c61bc17fc17c101829d8f9d080e58d6803b50195e5","observation_id":"4157bd93-f8dc-4561-a097-22a8d769ce9b","resolution":{"observed_at":"2026-08-03T21:09:50.189217Z","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-03T21:09:50.322574Z","title":"On the dimension and structure of the square of the dual of a Goppa code,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2511.17236","last_updated":"2026-06-25T09:12:00Z","snapshot_observed_at":"2026-08-18T03:45:10.450701Z","submitted_at":"2025-11-21T13:27:16Z","title":"The Star Product of Uniformly Random Codes","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-03T21:09:50.322574Z"},"links":{"citing_paper":"/paper/2511.17236"},"observation_digest":"sha256:59dc8b9d3b15d229d8bdba28af67989084bd9374630301cb3b53f58e8c032a35","observation_id":"e25efb49-01bd-47ff-a0c4-942a6f2ebcb1","resolution":{"observed_at":"2026-08-03T21:09:50.322574Z","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-03T21:09:50.468506Z","title":"On products and powers of linear codes under componentwise multiplication,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2511.17236","last_updated":"2026-06-25T09:12:00Z","snapshot_observed_at":"2026-08-18T03:45:10.450701Z","submitted_at":"2025-11-21T13:27:16Z","title":"The Star Product of Uniformly Random Codes","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-03T21:09:50.468506Z"},"links":{"citing_paper":"/paper/2511.17236"},"observation_digest":"sha256:7c29c06b19be970061813cbb5372861db553a60948adcaade684433785e0e0f7","observation_id":"4ec39e42-318e-4b97-99c6-4451b1743c80","resolution":{"observed_at":"2026-08-03T21:09:50.468506Z","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-03T21:09:50.571720Z","title":"On the existence of error-correcting pairs,","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2511.17236","last_updated":"2026-06-25T09:12:00Z","snapshot_observed_at":"2026-08-18T03:45:10.450701Z","submitted_at":"2025-11-21T13:27:16Z","title":"The Star Product of Uniformly Random Codes","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-03T21:09:50.571720Z"},"links":{"citing_paper":"/paper/2511.17236"},"observation_digest":"sha256:d252d035f26c08743ee7eab887711de001ca6c28a766b71939b94e65ccdd4727","observation_id":"165e369f-0caf-479c-a3e2-7b17cb91fab7","resolution":{"observed_at":"2026-08-03T21:09:50.571720Z","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-03T21:09:50.703700Z","title":"Cryptanalysis of McEliece cryp- tosystem based on algebraic geometry codes and their subcodes,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2511.17236","last_updated":"2026-06-25T09:12:00Z","snapshot_observed_at":"2026-08-18T03:45:10.450701Z","submitted_at":"2025-11-21T13:27:16Z","title":"The Star Product of Uniformly Random Codes","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-03T21:09:50.703700Z"},"links":{"citing_paper":"/paper/2511.17236"},"observation_digest":"sha256:3ac52097e445c8582d924d1b4477f0a7b33987dd4e2bab79d1aeb1d1a0178896","observation_id":"603427fc-997a-4f63-9d13-a4bf64ade75d","resolution":{"observed_at":"2026-08-03T21:09:50.703700Z","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-03T21:09:50.834582Z","title":"Squares of random linear codes,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2511.17236","last_updated":"2026-06-25T09:12:00Z","snapshot_observed_at":"2026-08-18T03:45:10.450701Z","submitted_at":"2025-11-21T13:27:16Z","title":"The Star Product of Uniformly Random Codes","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-03T21:09:50.834582Z"},"links":{"citing_paper":"/paper/2511.17236"},"observation_digest":"sha256:f1bdf1bf54655d3a5e793d2e8fc664f7033354debea0ba8d88096860deaea9ee","observation_id":"ebf96fb2-392e-4a7c-a280-ac324cfc6979","resolution":{"observed_at":"2026-08-03T21:09:50.834582Z","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-03T21:09:51.023347Z","title":null,"venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2511.17236","last_updated":"2026-06-25T09:12:00Z","snapshot_observed_at":"2026-08-18T03:45:10.450701Z","submitted_at":"2025-11-21T13:27:16Z","title":"The Star Product of Uniformly Random Codes","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-03T21:09:51.023347Z"},"links":{"citing_paper":"/paper/2511.17236"},"observation_digest":"sha256:7007857c0cb777efb1c7c3e85dfc2730f7eec554402ffa3205f5c53032684a67","observation_id":"a19ea3f6-dea3-45b6-9f0e-28e025eecd7c","resolution":{"observed_at":"2026-08-03T21:09:51.023347Z","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-03T21:09:51.203621Z","title":"An upper bound of Singleton type for componentwise products of linear codes,","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2511.17236","last_updated":"2026-06-25T09:12:00Z","snapshot_observed_at":"2026-08-18T03:45:10.450701Z","submitted_at":"2025-11-21T13:27:16Z","title":"The Star Product of Uniformly Random Codes","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-03T21:09:51.203621Z"},"links":{"citing_paper":"/paper/2511.17236"},"observation_digest":"sha256:5dda701b4736a8212fe9481e0e8558abbbf553d941716d462608e66653c400ce","observation_id":"6d3b4cd9-3ffb-447b-9532-c0bbca09c414","resolution":{"observed_at":"2026-08-03T21:09:51.203621Z","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-03T21:09:51.419469Z","title":"Matrices with restricted entries andq-analogues of permutations,","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2511.17236","last_updated":"2026-06-25T09:12:00Z","snapshot_observed_at":"2026-08-18T03:45:10.450701Z","submitted_at":"2025-11-21T13:27:16Z","title":"The Star Product of Uniformly Random Codes","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-03T21:09:51.419469Z"},"links":{"citing_paper":"/paper/2511.17236"},"observation_digest":"sha256:cda5dc1958968cb15190b3b794dfd11874484ccd26c7c54e249cd9a77554b843","observation_id":"31ee91a8-4901-4be2-b029-6874af3c0975","resolution":{"observed_at":"2026-08-03T21:09:51.419469Z","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-03T21:09:51.562144Z","title":"Duality of codes supported on regular lattices, with an application to enumerative combinatorics,","venue":null,"work_id":null,"year":2035},"citing_paper":{"arxiv_id":"2511.17236","last_updated":"2026-06-25T09:12:00Z","snapshot_observed_at":"2026-08-18T03:45:10.450701Z","submitted_at":"2025-11-21T13:27:16Z","title":"The Star Product of Uniformly Random Codes","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-03T21:09:51.562144Z"},"links":{"citing_paper":"/paper/2511.17236"},"observation_digest":"sha256:a2f919d2549fbe022a028bcc3dcda59b2792f353dd269be625ecd79c2bbf024a","observation_id":"32a51bda-d3ee-4eb2-b574-8b8f9908eae1","resolution":{"observed_at":"2026-08-03T21:09:51.562144Z","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-03T21:09:51.711738Z","title":"de Bruijn,Asymptotic methods in analysis, 3rd ed","venue":null,"work_id":null,"year":1970},"citing_paper":{"arxiv_id":"2511.17236","last_updated":"2026-06-25T09:12:00Z","snapshot_observed_at":"2026-08-18T03:45:10.450701Z","submitted_at":"2025-11-21T13:27:16Z","title":"The Star Product of Uniformly Random Codes","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-03T21:09:51.711738Z"},"links":{"citing_paper":"/paper/2511.17236"},"observation_digest":"sha256:17be8c5fe7f3cbfa66c982af3161fb69e703bf17656c2e668b8c5cacbf05ca0a","observation_id":"93250b9e-057c-41b5-bac4-e36205dae330","resolution":{"observed_at":"2026-08-03T21:09:51.711738Z","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-03T21:09:51.872697Z","title":"Oxley,Matroid Theory","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2511.17236","last_updated":"2026-06-25T09:12:00Z","snapshot_observed_at":"2026-08-18T03:45:10.450701Z","submitted_at":"2025-11-21T13:27:16Z","title":"The Star Product of Uniformly Random Codes","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-03T21:09:51.872697Z"},"links":{"citing_paper":"/paper/2511.17236"},"observation_digest":"sha256:5df4f4c9ed6d9ba457f3ef59c074244c26c8806b8b9b45d0aee10321fb6b2abe","observation_id":"6fc6dbe7-df21-47fe-9018-ee5418cc11ae","resolution":{"observed_at":"2026-08-03T21:09:51.872697Z","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-03T21:09:52.083815Z","title":null,"venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2511.17236","last_updated":"2026-06-25T09:12:00Z","snapshot_observed_at":"2026-08-18T03:45:10.450701Z","submitted_at":"2025-11-21T13:27:16Z","title":"The Star Product of Uniformly Random Codes","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-03T21:09:52.083815Z"},"links":{"citing_paper":"/paper/2511.17236"},"observation_digest":"sha256:216a1427ae9d9ad8d6479a92d6308fefc6ce1000c7eedb30362954acc0aaf5c5","observation_id":"b1476fc2-c94f-4d01-af82-0ab297e780bd","resolution":{"observed_at":"2026-08-03T21:09:52.083815Z","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-03T21:09:52.311472Z","title":"Linear independence of rank 1 matrices and the dimension of ∗-products of codes,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2511.17236","last_updated":"2026-06-25T09:12:00Z","snapshot_observed_at":"2026-08-18T03:45:10.450701Z","submitted_at":"2025-11-21T13:27:16Z","title":"The Star Product of Uniformly Random Codes","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-03T21:09:52.311472Z"},"links":{"citing_paper":"/paper/2511.17236"},"observation_digest":"sha256:83a0d401052b886efc2979aeaf6b64119e40214a101c9ef968d3fb609c606692","observation_id":"33c92180-9ae8-4920-99a1-57ce3fb3dfff","resolution":{"observed_at":"2026-08-03T21:09:52.311472Z","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-03T21:09:52.440555Z","title":"Private information retrieval,","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2511.17236","last_updated":"2026-06-25T09:12:00Z","snapshot_observed_at":"2026-08-18T03:45:10.450701Z","submitted_at":"2025-11-21T13:27:16Z","title":"The Star Product of Uniformly Random Codes","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-03T21:09:52.440555Z"},"links":{"citing_paper":"/paper/2511.17236"},"observation_digest":"sha256:1611e380baeb1ec4b057dfe683be1582204ac8e7e0c2872460b5d34ebe372cff","observation_id":"9eb0fe2a-f3f3-4cdd-9c99-2beaf8f68e62","resolution":{"observed_at":"2026-08-03T21:09:52.440555Z","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-03T21:09:52.608921Z","title":"The capacity of robust private information retrieval with collud- ing databases,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2511.17236","last_updated":"2026-06-25T09:12:00Z","snapshot_observed_at":"2026-08-18T03:45:10.450701Z","submitted_at":"2025-11-21T13:27:16Z","title":"The Star Product of Uniformly Random Codes","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-03T21:09:52.608921Z"},"links":{"citing_paper":"/paper/2511.17236"},"observation_digest":"sha256:bed7aba37c9b023f399118ef46b71970ac5dae8d5ff75dce262e1f41ec9f237c","observation_id":"7b58351d-50f8-4ff1-97e6-bcc68e32be1a","resolution":{"observed_at":"2026-08-03T21:09:52.608921Z","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-03T21:09:52.744038Z","title":"The capacity of private information retrieval from coded databases,","venue":null,"work_id":null,"year":1945},"citing_paper":{"arxiv_id":"2511.17236","last_updated":"2026-06-25T09:12:00Z","snapshot_observed_at":"2026-08-18T03:45:10.450701Z","submitted_at":"2025-11-21T13:27:16Z","title":"The Star Product of Uniformly Random Codes","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-03T21:09:52.744038Z"},"links":{"citing_paper":"/paper/2511.17236"},"observation_digest":"sha256:4c78a897f9aec3ead60b57f2860a5b52533001b0c45e9b8574d604b608fc965c","observation_id":"e4c29332-0501-4f2f-b311-0037a1678897","resolution":{"observed_at":"2026-08-03T21:09:52.744038Z","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-03T21:09:52.874416Z","title":"Symmetric private information retrieval from MDS coded distributed storage with non-colluding and colluding servers,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2511.17236","last_updated":"2026-06-25T09:12:00Z","snapshot_observed_at":"2026-08-18T03:45:10.450701Z","submitted_at":"2025-11-21T13:27:16Z","title":"The Star Product of Uniformly Random Codes","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-03T21:09:52.874416Z"},"links":{"citing_paper":"/paper/2511.17236"},"observation_digest":"sha256:db12689ae93357e03b0a7d60e1a60a7ecf116456740fc2c08944b22f1d4ebbc0","observation_id":"9e8c6f9e-0bf4-4e52-b60f-6e5c9cff4597","resolution":{"observed_at":"2026-08-03T21:09:52.874416Z","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-03T21:09:53.018281Z","title":"Robust private information retrieval from coded systems with Byzantine and colluding servers,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2511.17236","last_updated":"2026-06-25T09:12:00Z","snapshot_observed_at":"2026-08-18T03:45:10.450701Z","submitted_at":"2025-11-21T13:27:16Z","title":"The Star Product of Uniformly Random Codes","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-03T21:09:53.018281Z"},"links":{"citing_paper":"/paper/2511.17236"},"observation_digest":"sha256:00201d5f111b3698cdf2785ae5554acb93daefbd787d9736fd5e31c873afe3a4","observation_id":"f92b42fc-5eb8-46bc-b54c-d5cc47d35741","resolution":{"observed_at":"2026-08-03T21:09:53.018281Z","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-03T21:09:53.171785Z","title":"t-private information retrieval schemes using transitive codes,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2511.17236","last_updated":"2026-06-25T09:12:00Z","snapshot_observed_at":"2026-08-18T03:45:10.450701Z","submitted_at":"2025-11-21T13:27:16Z","title":"The Star Product of Uniformly Random Codes","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-03T21:09:53.171785Z"},"links":{"citing_paper":"/paper/2511.17236"},"observation_digest":"sha256:84954c91afb33ac396a5aa584dab05223061609db694c442d0e949dfe5d92f56","observation_id":"7f2225f9-55c8-4428-883e-ba9b3f6bf21b","resolution":{"observed_at":"2026-08-03T21:09:53.171785Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.00542","last_updated":"2024-08-01T13:26:52Z","snapshot_observed_at":"2026-08-16T13:29:13.944691Z","submitted_at":"2024-08-01T13:26:52Z","title":"Secret Sharing for Secure and Private Information Retrieval: A Construction Using Algebraic Geometry Codes","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.00542","snapshot_observed_at":"2026-08-03T21:09:53.364030Z","title":"Secret sharing for secure and private infor- mation retrieval: A construction using algebraic geometry codes,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2511.17236","last_updated":"2026-06-25T09:12:00Z","snapshot_observed_at":"2026-08-18T03:45:10.450701Z","submitted_at":"2025-11-21T13:27:16Z","title":"The Star Product of Uniformly Random Codes","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-03T21:09:53.364030Z"},"links":{"cited_paper":"/paper/2408.00542","citing_paper":"/paper/2511.17236"},"observation_digest":"sha256:44c6fbc86902a733004e1eb29d19550c95b3225c45c7e01567deac46b6757e04","observation_id":"f194aa8a-1923-4121-aab1-02f68bc734b2","resolution":{"observed_at":"2026-08-03T21:09:53.364030Z","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-03T21:09:53.483267Z","title":"Quantum private information re- trieval from coded and colluding servers,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2511.17236","last_updated":"2026-06-25T09:12:00Z","snapshot_observed_at":"2026-08-18T03:45:10.450701Z","submitted_at":"2025-11-21T13:27:16Z","title":"The Star Product of Uniformly Random Codes","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-03T21:09:53.483267Z"},"links":{"citing_paper":"/paper/2511.17236"},"observation_digest":"sha256:c00df8ec061c7df5f62d53864492ff08df4301d7dd3609f219b4b5c8781f878a","observation_id":"c53ef33f-2bf0-40db-a546-9f9dabe4f854","resolution":{"observed_at":"2026-08-03T21:09:53.483267Z","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-03T21:09:53.593586Z","title":"On the capacity of private informa- tion retrieval from coded, colluding, and adversarial servers,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2511.17236","last_updated":"2026-06-25T09:12:00Z","snapshot_observed_at":"2026-08-18T03:45:10.450701Z","submitted_at":"2025-11-21T13:27:16Z","title":"The Star Product of Uniformly Random Codes","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-03T21:09:53.593586Z"},"links":{"citing_paper":"/paper/2511.17236"},"observation_digest":"sha256:19376045032a6c733838464cdca6058ea06b3eb3cdce438adb7e55c75ea8af3c","observation_id":"412a98dd-66fc-4f9b-b839-a7ec80be3014","resolution":{"observed_at":"2026-08-03T21:09:53.593586Z","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-03T21:09:53.723830Z","title":"Toward the capacity of private information retrieval from coded and colluding servers,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2511.17236","last_updated":"2026-06-25T09:12:00Z","snapshot_observed_at":"2026-08-18T03:45:10.450701Z","submitted_at":"2025-11-21T13:27:16Z","title":"The Star Product of Uniformly Random Codes","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-03T21:09:53.723830Z"},"links":{"citing_paper":"/paper/2511.17236"},"observation_digest":"sha256:fdbdf06c0c89f75ad3994e9bfc71a43d6794c9a3819c163741fd80e1e39f9f39","observation_id":"a3265331-c5a7-4352-b112-7b354f830c25","resolution":{"observed_at":"2026-08-03T21:09:53.723830Z","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-03T21:09:53.846210Z","title":"GASP codes for secure distributed matrix multiplication,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2511.17236","last_updated":"2026-06-25T09:12:00Z","snapshot_observed_at":"2026-08-18T03:45:10.450701Z","submitted_at":"2025-11-21T13:27:16Z","title":"The Star Product of Uniformly Random Codes","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-03T21:09:53.846210Z"},"links":{"citing_paper":"/paper/2511.17236"},"observation_digest":"sha256:c826c8ecbc971d6118f39e1b5480b2a816524a7b6fdee67d8feba2aece086c5a","observation_id":"01d44466-9b50-4dd7-91ba-df904fbd3652","resolution":{"observed_at":"2026-08-03T21:09:53.846210Z","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-03T21:09:54.028815Z","title":"Private and secure distributed matrix multipli- cation with flexible communication load,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2511.17236","last_updated":"2026-06-25T09:12:00Z","snapshot_observed_at":"2026-08-18T03:45:10.450701Z","submitted_at":"2025-11-21T13:27:16Z","title":"The Star Product of Uniformly Random Codes","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-03T21:09:54.028815Z"},"links":{"citing_paper":"/paper/2511.17236"},"observation_digest":"sha256:d1971fd71fa49da485afdde4b64b57b88ec8a7fea32c44d901d0679208c3da05","observation_id":"e653cd0a-b940-4b8a-94b6-20937e5b8d1e","resolution":{"observed_at":"2026-08-03T21:09:54.028815Z","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-03T21:09:54.163521Z","title":"Secure distributed matrix computation with discrete Fourier transform,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2511.17236","last_updated":"2026-06-25T09:12:00Z","snapshot_observed_at":"2026-08-18T03:45:10.450701Z","submitted_at":"2025-11-21T13:27:16Z","title":"The Star Product of Uniformly Random Codes","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-03T21:09:54.163521Z"},"links":{"citing_paper":"/paper/2511.17236"},"observation_digest":"sha256:03081ec75e79a60a27b5a9c402cfeca699115297168e7e0975eeca0f19a06af7","observation_id":"50929855-95f1-42af-ada7-51ba3e410710","resolution":{"observed_at":"2026-08-03T21:09:54.163521Z","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-03T21:09:54.236636Z","title":"HerA scheme: Secure distributed matrix multiplication via Hermitian codes,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2511.17236","last_updated":"2026-06-25T09:12:00Z","snapshot_observed_at":"2026-08-18T03:45:10.450701Z","submitted_at":"2025-11-21T13:27:16Z","title":"The Star Product of Uniformly Random Codes","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-03T21:09:54.236636Z"},"links":{"citing_paper":"/paper/2511.17236"},"observation_digest":"sha256:f71fd654901a6557373003b71b5b77524f0c4d83c568330a5ee25eb17ded548a","observation_id":"9a1e56cb-4287-4249-897b-e25d0be64755","resolution":{"observed_at":"2026-08-03T21:09:54.236636Z","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-03T21:09:54.314182Z","title":"Good quantum error-correcting codes exist,","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2511.17236","last_updated":"2026-06-25T09:12:00Z","snapshot_observed_at":"2026-08-18T03:45:10.450701Z","submitted_at":"2025-11-21T13:27:16Z","title":"The Star Product of Uniformly Random Codes","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-03T21:09:54.314182Z"},"links":{"citing_paper":"/paper/2511.17236"},"observation_digest":"sha256:df076356510c0b306b21a00a80d71e49bf0c9986eee4380309f41548150d0e2b","observation_id":"83777c5b-83ce-44cc-bcc8-3a5aa749287e","resolution":{"observed_at":"2026-08-03T21:09:54.314182Z","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-03T21:09:54.485257Z","title":"Multiple-particle interference and quantum error correction,","venue":null,"work_id":null,"year":1954},"citing_paper":{"arxiv_id":"2511.17236","last_updated":"2026-06-25T09:12:00Z","snapshot_observed_at":"2026-08-18T03:45:10.450701Z","submitted_at":"2025-11-21T13:27:16Z","title":"The Star Product of Uniformly Random Codes","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-03T21:09:54.485257Z"},"links":{"citing_paper":"/paper/2511.17236"},"observation_digest":"sha256:b9b78790a882485f79d794afede0f39c7191fdf5c673d881b868c47262b4d2f5","observation_id":"831cb392-b308-4c27-b881-e9c007a22e41","resolution":{"observed_at":"2026-08-03T21:09:54.485257Z","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-03T21:09:54.614218Z","title":"Classical coding prob- lem from transversal T gates,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2511.17236","last_updated":"2026-06-25T09:12:00Z","snapshot_observed_at":"2026-08-18T03:45:10.450701Z","submitted_at":"2025-11-21T13:27:16Z","title":"The Star Product of Uniformly Random Codes","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-03T21:09:54.614218Z"},"links":{"citing_paper":"/paper/2511.17236"},"observation_digest":"sha256:6d5a8221b4fc8a1bf791065b71ca238490bbf74dd3df143e204e734c1e43da68","observation_id":"e434b36a-051c-42aa-a772-b7647f403ccf","resolution":{"observed_at":"2026-08-03T21:09:54.614218Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2511.17236","last_updated":"2026-06-25T09:12:00Z","latest_version":2,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-18T03:45:10.450701Z","submitted_at":"2025-11-21T13:27:16Z","title":"The Star Product of Uniformly Random Codes"},"reference_resolution":{"displayed":43,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":43,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":43},"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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 43 of 43 outbound references and 0 inbound Pith citation observations for arXiv:2511.17236."}