{"as_of":"2026-08-12T20:24:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:df7a5545faf151c128b3ebf77fe5a4319fcfac05d078f286b413f8a01abb5c76","coverage":[{"denominator":29,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":29,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-13T18:35:49.934538Z","state":"measured"},{"denominator":29,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":29,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+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/2604.03168/citation-record","integrity":"/paper/2604.03168/integrity","json":"/paper/2604.03168/citation-record.json","paper":"/paper/2604.03168"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Lin and D","venue":null,"work_id":"2b36398a-318d-40ba-9aa9-a5c007392c1b","year":2001},"citing_paper":{"arxiv_id":"2604.03168","last_updated":"2026-04-03T16:45:45Z","snapshot_observed_at":"2026-08-11T07:32:52.377848Z","submitted_at":"2026-04-03T16:45:45Z","title":"An Algebraic Method for Full-Rank Characterization in Binary Linear Coding","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-13T18:35:49.934538Z"},"links":{"citing_paper":"/paper/2604.03168"},"observation_digest":"sha256:e45e57da38cd8287b1accab6a7f33e3e35c3515f55fcf4d8550360e5e8163c89","observation_id":"e1d4ea39-2d43-4185-8456-311c1aacf147","resolution":{"observed_at":"2026-05-14T04:01:05.982811Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"8ee9dd2a-a9f0-4770-9339-302140cf9eb7","year":2008},"citing_paper":{"arxiv_id":"2604.03168","last_updated":"2026-04-03T16:45:45Z","snapshot_observed_at":"2026-08-11T07:32:52.377848Z","submitted_at":"2026-04-03T16:45:45Z","title":"An Algebraic Method for Full-Rank Characterization in Binary Linear Coding","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-13T18:35:49.934538Z"},"links":{"citing_paper":"/paper/2604.03168"},"observation_digest":"sha256:8b2084f18ec567ef9e43b655639b31f6447d0b75ba2d7cb4606fb4518df2011a","observation_id":"847e061f-fc4b-4652-a5ba-771fc04e92fa","resolution":{"observed_at":"2026-05-14T04:01:06.023101Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Richardson and R","venue":null,"work_id":"aeec974d-ce75-4d00-ad5b-bd65247014e9","year":2008},"citing_paper":{"arxiv_id":"2604.03168","last_updated":"2026-04-03T16:45:45Z","snapshot_observed_at":"2026-08-11T07:32:52.377848Z","submitted_at":"2026-04-03T16:45:45Z","title":"An Algebraic Method for Full-Rank Characterization in Binary Linear Coding","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-13T18:35:49.934538Z"},"links":{"citing_paper":"/paper/2604.03168"},"observation_digest":"sha256:05ae70c030b03926ba19b3cc22bb312a654e5ccc00073bffa3d1b602a88e8363","observation_id":"9cee7a75-026b-4a1d-9682-35f9615bd6a4","resolution":{"observed_at":"2026-05-14T04:01:06.027563Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Network coding for distributed storage systems","venue":null,"work_id":"0293b06d-6aca-4d93-b8fa-8d127c39d8cc","year":2010},"citing_paper":{"arxiv_id":"2604.03168","last_updated":"2026-04-03T16:45:45Z","snapshot_observed_at":"2026-08-11T07:32:52.377848Z","submitted_at":"2026-04-03T16:45:45Z","title":"An Algebraic Method for Full-Rank Characterization in Binary Linear Coding","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-13T18:35:49.934538Z"},"links":{"citing_paper":"/paper/2604.03168"},"observation_digest":"sha256:b9f9de382d95368437c397ba44148db7f13c7dd3adc720f46695c78788e29592","observation_id":"aee48517-1a7e-4509-8356-84a3f1631213","resolution":{"observed_at":"2026-05-14T04:01:06.015262Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"On the locality of codeword symbols","venue":null,"work_id":"e486a1e9-02e5-4dca-a54d-8137b76e13d2","year":2012},"citing_paper":{"arxiv_id":"2604.03168","last_updated":"2026-04-03T16:45:45Z","snapshot_observed_at":"2026-08-11T07:32:52.377848Z","submitted_at":"2026-04-03T16:45:45Z","title":"An Algebraic Method for Full-Rank Characterization in Binary Linear Coding","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-13T18:35:49.934538Z"},"links":{"citing_paper":"/paper/2604.03168"},"observation_digest":"sha256:e5df0eba58c9d20b59c03da1c81c75f1c4aa07959c49cfb1bbfd94174f504413","observation_id":"0c9874aa-cc4a-4883-86a6-6d2739fa0cf0","resolution":{"observed_at":"2026-05-14T04:01:05.998412Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Locally repairable codes","venue":null,"work_id":"aed36ee6-aaeb-4fd9-91e7-7b91574d98a4","year":2014},"citing_paper":{"arxiv_id":"2604.03168","last_updated":"2026-04-03T16:45:45Z","snapshot_observed_at":"2026-08-11T07:32:52.377848Z","submitted_at":"2026-04-03T16:45:45Z","title":"An Algebraic Method for Full-Rank Characterization in Binary Linear Coding","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-13T18:35:49.934538Z"},"links":{"citing_paper":"/paper/2604.03168"},"observation_digest":"sha256:2a46829eaac9e79ee4e3a9f7433cc5d2bff383ed46f0b6bd92465b8c149a0354","observation_id":"449a9b39-715f-4a2b-982f-2a1dafd51237","resolution":{"observed_at":"2026-05-14T04:01:05.986599Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Speeding up distributed machine learning using codes","venue":null,"work_id":"599509a2-f808-448b-82ae-3ea9ae59fd3f","year":2018},"citing_paper":{"arxiv_id":"2604.03168","last_updated":"2026-04-03T16:45:45Z","snapshot_observed_at":"2026-08-11T07:32:52.377848Z","submitted_at":"2026-04-03T16:45:45Z","title":"An Algebraic Method for Full-Rank Characterization in Binary Linear Coding","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-13T18:35:49.934538Z"},"links":{"citing_paper":"/paper/2604.03168"},"observation_digest":"sha256:c1dd32744010b3642b853ac81c300cdf9d421983e3171c38f0a60003f7612cdd","observation_id":"b814ca08-6a26-4bb6-ba97-5528a9b07264","resolution":{"observed_at":"2026-05-14T04:01:05.994501Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Lagrange coded computing: Optimal design for resiliency, security, and privacy","venue":null,"work_id":"cc5fb0ea-2e42-4123-b6b3-731e94efb910","year":2019},"citing_paper":{"arxiv_id":"2604.03168","last_updated":"2026-04-03T16:45:45Z","snapshot_observed_at":"2026-08-11T07:32:52.377848Z","submitted_at":"2026-04-03T16:45:45Z","title":"An Algebraic Method for Full-Rank Characterization in Binary Linear Coding","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-13T18:35:49.934538Z"},"links":{"citing_paper":"/paper/2604.03168"},"observation_digest":"sha256:ed1ac8840d2951a243aef57fbe7c553238ac51b8625806c1c5a956b23ab4a8d7","observation_id":"7a912335-4ea9-460f-b327-592b98b211fa","resolution":{"observed_at":"2026-05-14T04:01:06.006957Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Linear network coding","venue":null,"work_id":"2c5b1b48-098f-4c09-afdf-3263d340803d","year":2003},"citing_paper":{"arxiv_id":"2604.03168","last_updated":"2026-04-03T16:45:45Z","snapshot_observed_at":"2026-08-11T07:32:52.377848Z","submitted_at":"2026-04-03T16:45:45Z","title":"An Algebraic Method for Full-Rank Characterization in Binary Linear Coding","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-13T18:35:49.934538Z"},"links":{"citing_paper":"/paper/2604.03168"},"observation_digest":"sha256:17813468548bf9a7cab3776e068c942d97e5f6ea30a3700dee393e9d941c74b5","observation_id":"b026bde8-2fa8-4762-8a4e-b7f79efd4632","resolution":{"observed_at":"2026-05-14T04:01:05.969965Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"An algebraic approach to network coding","venue":null,"work_id":"fef6730f-67e9-47b5-a9ec-cf73d5fc9311","year":2003},"citing_paper":{"arxiv_id":"2604.03168","last_updated":"2026-04-03T16:45:45Z","snapshot_observed_at":"2026-08-11T07:32:52.377848Z","submitted_at":"2026-04-03T16:45:45Z","title":"An Algebraic Method for Full-Rank Characterization in Binary Linear Coding","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-13T18:35:49.934538Z"},"links":{"citing_paper":"/paper/2604.03168"},"observation_digest":"sha256:e12a6f216fb8de045c04bd11fcd81186e59cfd0227063409d57b0fe0e4334c88","observation_id":"a41038ad-5d5d-4c92-8253-21233de1c823","resolution":{"observed_at":"2026-05-14T04:01:05.978507Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Polynomial time algorithms for multicast network code construction","venue":null,"work_id":"f32807ed-42af-4b6f-8ab5-716b94e9fb10","year":1973},"citing_paper":{"arxiv_id":"2604.03168","last_updated":"2026-04-03T16:45:45Z","snapshot_observed_at":"2026-08-11T07:32:52.377848Z","submitted_at":"2026-04-03T16:45:45Z","title":"An Algebraic Method for Full-Rank Characterization in Binary Linear Coding","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-13T18:35:49.934538Z"},"links":{"citing_paper":"/paper/2604.03168"},"observation_digest":"sha256:1ab1f610382cef2dc33aec2fad802e4a28bb371f07f5782466b59c03675e02fb","observation_id":"6b1d319e-dc69-4236-8e42-e6b829b7662c","resolution":{"observed_at":"2026-05-14T04:01:05.990483Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"The encoding complexity of network coding","venue":null,"work_id":"3a93a718-90fb-424e-9be3-55d3e830eede","year":2006},"citing_paper":{"arxiv_id":"2604.03168","last_updated":"2026-04-03T16:45:45Z","snapshot_observed_at":"2026-08-11T07:32:52.377848Z","submitted_at":"2026-04-03T16:45:45Z","title":"An Algebraic Method for Full-Rank Characterization in Binary Linear Coding","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-13T18:35:49.934538Z"},"links":{"citing_paper":"/paper/2604.03168"},"observation_digest":"sha256:6b1cacc0792275fdbbd3c50330854a279982ba89ece3fe8ce1526ba4af0573e3","observation_id":"7d14fe1b-fb37-4b76-bd4e-e9c3b0d99093","resolution":{"observed_at":"2026-05-14T04:01:05.974061Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/bf02328447","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Basic principles of mechanical theorem proving in elementary geometrics","venue":"Journal of Automated Reasoning","work_id":"dd73bf22-9bca-4fe5-89dc-d91bc166fc54","year":1986},"citing_paper":{"arxiv_id":"2604.03168","last_updated":"2026-04-03T16:45:45Z","snapshot_observed_at":"2026-08-11T07:32:52.377848Z","submitted_at":"2026-04-03T16:45:45Z","title":"An Algebraic Method for Full-Rank Characterization in Binary Linear Coding","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-13T18:35:49.934538Z"},"links":{"citing_paper":"/paper/2604.03168"},"observation_digest":"sha256:1bdf666fc56640eac5fb07ebc547cdc6d26fe65e69905ec59c9d10b3eab051f9","observation_id":"49eafc32-d03b-44df-b8e9-d850bc375ca2","resolution":{"observed_at":"2026-05-13T18:38:07.021280Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"1993.1035","doi":"10.1006/jabr.1993.1035","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"An elimination method for polynomial systems","venue":"Journal of Algebra","work_id":"531a8527-bb0a-437d-9ee8-631675b40c12","year":2003},"citing_paper":{"arxiv_id":"2604.03168","last_updated":"2026-04-03T16:45:45Z","snapshot_observed_at":"2026-08-11T07:32:52.377848Z","submitted_at":"2026-04-03T16:45:45Z","title":"An Algebraic Method for Full-Rank Characterization in Binary Linear Coding","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-13T18:35:49.934538Z"},"links":{"citing_paper":"/paper/2604.03168"},"observation_digest":"sha256:a6e0183a120557b1cffbfbc631e5a79aa55daf892baeeb9534086a684fb205ca","observation_id":"862783d5-72f4-438c-a0c4-4ea3261d225c","resolution":{"observed_at":"2026-05-13T18:38:07.023814Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"4081.164143","doi":"10.1145/164081.164143","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Some results on theorem proving in geometry over finite fields","venue":null,"work_id":"ab63dbed-c1a3-49e8-999f-a88876dbc94a","year":1993},"citing_paper":{"arxiv_id":"2604.03168","last_updated":"2026-04-03T16:45:45Z","snapshot_observed_at":"2026-08-11T07:32:52.377848Z","submitted_at":"2026-04-03T16:45:45Z","title":"An Algebraic Method for Full-Rank Characterization in Binary Linear Coding","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-13T18:35:49.934538Z"},"links":{"citing_paper":"/paper/2604.03168"},"observation_digest":"sha256:4c910b86ef33775f3086669a7d425b6e953bb2dd9e8f65205809bad9fbd78837","observation_id":"cd0c1f91-b7af-4b15-bce2-c53e6f31e6a5","resolution":{"observed_at":"2026-05-13T18:38:07.026358Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"pii/0166218","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A new method for solving algebraic systems of positive dimension","venue":null,"work_id":"72aa726b-f8bc-457b-9f62-4e8b7c14756b","year":1991},"citing_paper":{"arxiv_id":"2604.03168","last_updated":"2026-04-03T16:45:45Z","snapshot_observed_at":"2026-08-11T07:32:52.377848Z","submitted_at":"2026-04-03T16:45:45Z","title":"An Algebraic Method for Full-Rank Characterization in Binary Linear Coding","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-13T18:35:49.934538Z"},"links":{"citing_paper":"/paper/2604.03168"},"observation_digest":"sha256:15dc7131484e456b48b8ba1c7900821d41510cf28d41d8d4bb761a5c351e2aa0","observation_id":"24fef2d5-a56e-4ad3-b059-1185f8f16c55","resolution":{"observed_at":"2026-05-13T18:38:07.494905Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A generalized euclidean algorithm for computing triangular representations of algebraic varieties","venue":null,"work_id":"9a995d84-8fbf-4ff6-af46-674c5fee6a3d","year":1993},"citing_paper":{"arxiv_id":"2604.03168","last_updated":"2026-04-03T16:45:45Z","snapshot_observed_at":"2026-08-11T07:32:52.377848Z","submitted_at":"2026-04-03T16:45:45Z","title":"An Algebraic Method for Full-Rank Characterization in Binary Linear Coding","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-13T18:35:49.934538Z"},"links":{"citing_paper":"/paper/2604.03168"},"observation_digest":"sha256:a456d88809408230879e9bf4bf53c9f19b5540a0aee4bfe05f1bc7b988a17e02","observation_id":"9987c0ad-a751-44ea-bdb2-4099da99d897","resolution":{"observed_at":"2026-05-14T04:01:06.002542Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Ritt-wu’s decomposition algorithm and geometry theorem proving","venue":null,"work_id":"8408b295-2780-449e-89ef-e43fe2d13822","year":1990},"citing_paper":{"arxiv_id":"2604.03168","last_updated":"2026-04-03T16:45:45Z","snapshot_observed_at":"2026-08-11T07:32:52.377848Z","submitted_at":"2026-04-03T16:45:45Z","title":"An Algebraic Method for Full-Rank Characterization in Binary Linear Coding","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-13T18:35:49.934538Z"},"links":{"citing_paper":"/paper/2604.03168"},"observation_digest":"sha256:747a012c4ab702569bd53358ddaa6bfd908f47ba6ec17c4aad7bd6e7042f6868","observation_id":"c5455576-a5a9-4ea5-86e7-75e57f3b6c83","resolution":{"observed_at":"2026-05-14T04:01:06.011131Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"On the theories of triangular sets","venue":null,"work_id":"bf2f498f-cb61-4c44-b51a-8741b2be5f8b","year":1999},"citing_paper":{"arxiv_id":"2604.03168","last_updated":"2026-04-03T16:45:45Z","snapshot_observed_at":"2026-08-11T07:32:52.377848Z","submitted_at":"2026-04-03T16:45:45Z","title":"An Algebraic Method for Full-Rank Characterization in Binary Linear Coding","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-13T18:35:49.934538Z"},"links":{"citing_paper":"/paper/2604.03168"},"observation_digest":"sha256:ea04b1e94503c512e27c02ed303433953ebe15f035858f209a3e84d2dbc376e3","observation_id":"28238d64-eb19-4ec2-a32d-5c19faf3291f","resolution":{"observed_at":"2026-05-14T04:01:06.019260Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A characteristic set method for solving boolean equationsand applications in cryptanalysis of stream ciphers","venue":null,"work_id":"4a17ad93-ea59-4d50-bc86-6b0edf58115e","year":2008},"citing_paper":{"arxiv_id":"2604.03168","last_updated":"2026-04-03T16:45:45Z","snapshot_observed_at":"2026-08-11T07:32:52.377848Z","submitted_at":"2026-04-03T16:45:45Z","title":"An Algebraic Method for Full-Rank Characterization in Binary Linear Coding","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-13T18:35:49.934538Z"},"links":{"citing_paper":"/paper/2604.03168"},"observation_digest":"sha256:fc38318daf31eaa341b9acbbba85ca77b22ff7e59498eb4731a932af6bb53806","observation_id":"ee1132f0-f915-465a-87a5-ad299aa28cfa","resolution":{"observed_at":"2026-05-14T04:01:05.942060Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Characteristic set algorithms for equation solving in finite fields","venue":null,"work_id":"cdbd7cf1-d795-46b8-a18f-f1dc478902e9","year":2012},"citing_paper":{"arxiv_id":"2604.03168","last_updated":"2026-04-03T16:45:45Z","snapshot_observed_at":"2026-08-11T07:32:52.377848Z","submitted_at":"2026-04-03T16:45:45Z","title":"An Algebraic Method for Full-Rank Characterization in Binary Linear Coding","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-13T18:35:49.934538Z"},"links":{"citing_paper":"/paper/2604.03168"},"observation_digest":"sha256:fcf9c676e2ad2a3cbbe637b7b1827efb7e9310ebfc84654abbe5c5e92b6ed8ca","observation_id":"0344c07c-1d77-401a-a47f-b347eb9565f7","resolution":{"observed_at":"2026-05-14T04:01:05.946103Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"On the efficiency of solving boolean polynomial systems with the characteristic set method","venue":null,"work_id":"3fd0244b-d665-4998-be16-6f4a62feb707","year":2021},"citing_paper":{"arxiv_id":"2604.03168","last_updated":"2026-04-03T16:45:45Z","snapshot_observed_at":"2026-08-11T07:32:52.377848Z","submitted_at":"2026-04-03T16:45:45Z","title":"An Algebraic Method for Full-Rank Characterization in Binary Linear Coding","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-13T18:35:49.934538Z"},"links":{"citing_paper":"/paper/2604.03168"},"observation_digest":"sha256:7be7297866157f4e96382c4aa0f95340d80e491db2f72a0ba1501963a36cf9c0","observation_id":"881fdfbf-7316-49b5-af17-5f238509b8c3","resolution":{"observed_at":"2026-05-14T04:01:05.932496Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Pbcs: an efficient parallel characteristic set method for solving boolean polynomial systems","venue":null,"work_id":"1bdfee34-c421-495f-b355-2d19cb825433","year":2018},"citing_paper":{"arxiv_id":"2604.03168","last_updated":"2026-04-03T16:45:45Z","snapshot_observed_at":"2026-08-11T07:32:52.377848Z","submitted_at":"2026-04-03T16:45:45Z","title":"An Algebraic Method for Full-Rank Characterization in Binary Linear Coding","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-13T18:35:49.934538Z"},"links":{"citing_paper":"/paper/2604.03168"},"observation_digest":"sha256:faf61a5cf1774dbd3c2b2d77d9fcf15638d4e57476f8f152272769b964b8c067","observation_id":"c685715b-e2a6-4674-a206-dd8a55987cd5","resolution":{"observed_at":"2026-05-14T04:01:05.936953Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Chordal graphs in triangular decomposition in top-down style","venue":null,"work_id":"04ba44ba-4801-4172-b394-e74c1935cf75","year":2021},"citing_paper":{"arxiv_id":"2604.03168","last_updated":"2026-04-03T16:45:45Z","snapshot_observed_at":"2026-08-11T07:32:52.377848Z","submitted_at":"2026-04-03T16:45:45Z","title":"An Algebraic Method for Full-Rank Characterization in Binary Linear Coding","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-13T18:35:49.934538Z"},"links":{"citing_paper":"/paper/2604.03168"},"observation_digest":"sha256:fd3415e8d4ddf7726478a1dd10bd765c27256ac5e0e33fc54de1a6ad5c9fee68","observation_id":"d93dde20-5f6d-437f-88bd-f154da9a06e4","resolution":{"observed_at":"2026-05-14T04:01:05.957447Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Erasure coding in windows azure storage","venue":null,"work_id":"8c930f43-ce2f-4fd7-a50a-f89e5d8461cb","year":2012},"citing_paper":{"arxiv_id":"2604.03168","last_updated":"2026-04-03T16:45:45Z","snapshot_observed_at":"2026-08-11T07:32:52.377848Z","submitted_at":"2026-04-03T16:45:45Z","title":"An Algebraic Method for Full-Rank Characterization in Binary Linear Coding","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-13T18:35:49.934538Z"},"links":{"citing_paper":"/paper/2604.03168"},"observation_digest":"sha256:33669258603149cb13566bc3b12401e5a39fba16c09a93c8db2d26d9f71f7518","observation_id":"f6ecc1c0-9ec5-453e-8829-52e7fd266f20","resolution":{"observed_at":"2026-05-14T04:01:05.962048Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Xoring elephants: novel erasure codes for big data","venue":null,"work_id":"17b3e94a-0f7b-4617-9965-7988aeec7c63","year":2013},"citing_paper":{"arxiv_id":"2604.03168","last_updated":"2026-04-03T16:45:45Z","snapshot_observed_at":"2026-08-11T07:32:52.377848Z","submitted_at":"2026-04-03T16:45:45Z","title":"An Algebraic Method for Full-Rank Characterization in Binary Linear Coding","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-05-13T18:35:49.934538Z"},"links":{"citing_paper":"/paper/2604.03168"},"observation_digest":"sha256:adefeecb79d3ea1d784bbe08c1af3b0f2286210381b4554f9e96bc59b35191b3","observation_id":"bd731289-6a1e-481b-8105-6491bb3bd94e","resolution":{"observed_at":"2026-05-14T04:01:05.953491Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Parallelized progressive network coding with hardware acceleration","venue":null,"work_id":"bfd54b5c-2b4b-47fa-b21f-52bd79834eb1","year":2007},"citing_paper":{"arxiv_id":"2604.03168","last_updated":"2026-04-03T16:45:45Z","snapshot_observed_at":"2026-08-11T07:32:52.377848Z","submitted_at":"2026-04-03T16:45:45Z","title":"An Algebraic Method for Full-Rank Characterization in Binary Linear Coding","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-05-13T18:35:49.934538Z"},"links":{"citing_paper":"/paper/2604.03168"},"observation_digest":"sha256:364b060968ea1b28ff3fa4caf49f8933415b0c90d1c0f0df08bb99bc78f48386","observation_id":"dc18ddb1-c898-4425-9bb7-dd8295a2f63a","resolution":{"observed_at":"2026-05-14T04:01:05.949754Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-08T01:54:26.679688Z","title":"1.1 computing’s energy problem (and what we can do about it)","venue":null,"work_id":"ee117dd8-219e-4da6-a783-0e0f4389342a","year":2014},"citing_paper":{"arxiv_id":"2604.03168","last_updated":"2026-04-03T16:45:45Z","snapshot_observed_at":"2026-08-11T07:32:52.377848Z","submitted_at":"2026-04-03T16:45:45Z","title":"An Algebraic Method for Full-Rank Characterization in Binary Linear Coding","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-05-13T18:35:49.934538Z"},"links":{"citing_paper":"/paper/2604.03168"},"observation_digest":"sha256:63ef284dfc1e171efde3d577653729a157f6c02c720febbd35ffd247205821ad","observation_id":"0643fc12-09f3-450a-a089-ff1f4146d44f","resolution":{"observed_at":"2026-05-14T04:01:05.928105Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"RC2: an efficient MaxSAT solver","venue":null,"work_id":"568d96d1-326b-4c54-8abb-da382d9b29ed","year":2019},"citing_paper":{"arxiv_id":"2604.03168","last_updated":"2026-04-03T16:45:45Z","snapshot_observed_at":"2026-08-11T07:32:52.377848Z","submitted_at":"2026-04-03T16:45:45Z","title":"An Algebraic Method for Full-Rank Characterization in Binary Linear Coding","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-05-13T18:35:49.934538Z"},"links":{"citing_paper":"/paper/2604.03168"},"observation_digest":"sha256:f50d59d48ed6d1239f3fd654874a9db763890d09ddd6a22fd1f06e007b511535","observation_id":"b6c8efc1-ff67-49aa-9d58-4228fbdd29f4","resolution":{"observed_at":"2026-05-14T04:01:05.966105Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2604.03168","last_updated":"2026-04-03T16:45:45Z","latest_version":1,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-11T07:32:52.377848Z","submitted_at":"2026-04-03T16:45:45Z","title":"An Algebraic Method for Full-Rank Characterization in Binary Linear Coding"},"reference_resolution":{"displayed":29,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":1,"verified_exact":3,"verified_fuzzy":24},"total_outbound_references":29},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 29 of 29 outbound references and 0 inbound Pith citation observations for arXiv:2604.03168."}