{"as_of":"2026-08-22T09:51:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:07e598ce8f4423c019ef61286e1f790450c5d8eea1595c208bfe07a7499aafc3","coverage":[{"denominator":14,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":14,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-29T14:20:55.968621Z","state":"measured"},{"denominator":14,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":14,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-22T06:32:14.747728+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/2605.28612/citation-record","integrity":"/paper/2605.28612/integrity","json":"/paper/2605.28612/citation-record.json","paper":"/paper/2605.28612"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2025.361568","doi":"10.1109/tcomm.2025.3615681","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Learning linear block codes with gradient quantization,","venue":"IEEE Transactions on Communications","work_id":"4aee04d7-d851-431e-982d-4297c525cafd","year":2025},"citing_paper":{"arxiv_id":"2605.28612","last_updated":"2026-05-27T15:26:16Z","snapshot_observed_at":"2026-08-03T21:00:41.368923Z","submitted_at":"2026-05-27T15:26:16Z","title":"Learning High-Dimensional Parity Functions with Product Networks using Gradient Descent","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-29T14:20:55.968621Z"},"links":{"citing_paper":"/paper/2605.28612"},"observation_digest":"sha256:28871592e97084d8349c21d2774b3bc502c0a546b10d7e5e64d7ab56d961bdab","observation_id":"a7df0e79-480b-4b8c-adbd-4fef0d4fec7f","resolution":{"observed_at":"2026-06-29T14:23:30.041171Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-07-18T03:22:46.251272+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-18T03:22:46.251272+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T14:20:55.968621Z","title":"Minor, J","venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"2605.28612","last_updated":"2026-05-27T15:26:16Z","snapshot_observed_at":"2026-08-03T21:00:41.368923Z","submitted_at":"2026-05-27T15:26:16Z","title":"Learning High-Dimensional Parity Functions with Product Networks using Gradient Descent","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-29T14:20:55.968621Z"},"links":{"citing_paper":"/paper/2605.28612"},"observation_digest":"sha256:0a3674e3fe5d33d54543242cfcd1325cde18a8ab8d20cda23db34f0406a3f5c9","observation_id":"793605e0-4935-4ae6-8157-52d7345b9602","resolution":{"observed_at":"2026-06-29T14:20:55.968621Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2017.278840","doi":"10.1109/jstsp.2017.2788405","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"IEEE Journal of Selected Topics in Signal Processing","work_id":"5a43574d-06b2-4838-92ea-64105de83a1b","year":2017},"citing_paper":{"arxiv_id":"2605.28612","last_updated":"2026-05-27T15:26:16Z","snapshot_observed_at":"2026-08-03T21:00:41.368923Z","submitted_at":"2026-05-27T15:26:16Z","title":"Learning High-Dimensional Parity Functions with Product Networks using Gradient Descent","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-29T14:20:55.968621Z"},"links":{"citing_paper":"/paper/2605.28612"},"observation_digest":"sha256:74c35f36e8959b39551e9c2ff85bd3ba09e31eb25596e521fcd1a94a7b81537b","observation_id":"27ef9f13-41b1-4ce7-84a8-efa64024939f","resolution":{"observed_at":"2026-06-29T14:23:30.043827Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1109/ijcnn.2003","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"cc/paper_files/paper/2018/file/ 0e64a7b00c83e3d22ce6b3acf2c582b6-Paper","venue":null,"work_id":"48c82d3f-9a3c-4dd9-a6a1-fbd7e6c78e98","year":2018},"citing_paper":{"arxiv_id":"2605.28612","last_updated":"2026-05-27T15:26:16Z","snapshot_observed_at":"2026-08-03T21:00:41.368923Z","submitted_at":"2026-05-27T15:26:16Z","title":"Learning High-Dimensional Parity Functions with Product Networks using Gradient Descent","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-29T14:20:55.968621Z"},"links":{"citing_paper":"/paper/2605.28612"},"observation_digest":"sha256:3c589fbd4378e1e40bb4d60a170dfb5ea3c3d9cd62ba3a34b2b4fd90f1518f7d","observation_id":"2a3db404-eb8e-41ab-91aa-e53b886c4a53","resolution":{"observed_at":"2026-06-29T14:23:30.040617Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T14:20:55.968621Z","title":"F.1–F.2)","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2605.28612","last_updated":"2026-05-27T15:26:16Z","snapshot_observed_at":"2026-08-03T21:00:41.368923Z","submitted_at":"2026-05-27T15:26:16Z","title":"Learning High-Dimensional Parity Functions with Product Networks using Gradient Descent","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-29T14:20:55.968621Z"},"links":{"citing_paper":"/paper/2605.28612"},"observation_digest":"sha256:414f25abbf6d044ad529d4c6fa5ebbc769456e7aecf327bad0eaafd117a40f07","observation_id":"4f18f290-1f7b-492f-83ce-8ea8ab1f8606","resolution":{"observed_at":"2026-06-29T14:20:55.968621Z","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-06-29T14:20:55.968621Z","title":"F.4–F.6)","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2605.28612","last_updated":"2026-05-27T15:26:16Z","snapshot_observed_at":"2026-08-03T21:00:41.368923Z","submitted_at":"2026-05-27T15:26:16Z","title":"Learning High-Dimensional Parity Functions with Product Networks using Gradient Descent","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-29T14:20:55.968621Z"},"links":{"citing_paper":"/paper/2605.28612"},"observation_digest":"sha256:cb8029210ee90e92334c3558573602b325d0d672948c8b936288cf97477c9088","observation_id":"b21470e2-e484-4c74-9851-a8ee096e85ae","resolution":{"observed_at":"2026-06-29T14:20:55.968621Z","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-06-29T14:20:55.968621Z","title":"F.14–F.16)","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2605.28612","last_updated":"2026-05-27T15:26:16Z","snapshot_observed_at":"2026-08-03T21:00:41.368923Z","submitted_at":"2026-05-27T15:26:16Z","title":"Learning High-Dimensional Parity Functions with Product Networks using Gradient Descent","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-06-29T14:20:55.968621Z"},"links":{"citing_paper":"/paper/2605.28612"},"observation_digest":"sha256:cfe17d1bab0ed8dcdf02d66a7bc43db1ddd3248c03162dc9cbdd06ba8aa3a5a2","observation_id":"509dac47-5791-4297-9868-48bafcdd0526","resolution":{"observed_at":"2026-06-29T14:20:55.968621Z","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-06-29T14:20:55.968621Z","title":"F.18–F.23)","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2605.28612","last_updated":"2026-05-27T15:26:16Z","snapshot_observed_at":"2026-08-03T21:00:41.368923Z","submitted_at":"2026-05-27T15:26:16Z","title":"Learning High-Dimensional Parity Functions with Product Networks using Gradient Descent","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-06-29T14:20:55.968621Z"},"links":{"citing_paper":"/paper/2605.28612"},"observation_digest":"sha256:e5a1add81931d0168ee07203a1cac8d21ea28de712e0850371a6ce1606538477","observation_id":"60eb4dbe-7bb3-4b32-a5e6-79f0453089ef","resolution":{"observed_at":"2026-06-29T14:20:55.968621Z","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-06-29T14:20:55.968621Z","title":"ym −y true m #2 = 1 M MX m=1","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2605.28612","last_updated":"2026-05-27T15:26:16Z","snapshot_observed_at":"2026-08-03T21:00:41.368923Z","submitted_at":"2026-05-27T15:26:16Z","title":"Learning High-Dimensional Parity Functions with Product Networks using Gradient Descent","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-06-29T14:20:55.968621Z"},"links":{"citing_paper":"/paper/2605.28612"},"observation_digest":"sha256:9cd429a92b0c76d336e3b76c4e5b71b01f880ed58a94d03799ab33c67ef262e1","observation_id":"30af9d1c-e7ac-410e-ace7-5e2efd8651ba","resolution":{"observed_at":"2026-06-29T14:20:55.968621Z","resolver_source":null,"status":"malformed_identifier"},"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-06-29T14:20:55.968621Z","title":"jump over","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2605.28612","last_updated":"2026-05-27T15:26:16Z","snapshot_observed_at":"2026-08-03T21:00:41.368923Z","submitted_at":"2026-05-27T15:26:16Z","title":"Learning High-Dimensional Parity Functions with Product Networks using Gradient Descent","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-06-29T14:20:55.968621Z"},"links":{"citing_paper":"/paper/2605.28612"},"observation_digest":"sha256:3272afa91acf88569739e1324d6d022701bc72da8ed9e750e88863c94b5a6d35","observation_id":"a587ec09-776e-460c-8799-a9d004858d7e","resolution":{"observed_at":"2026-06-29T14:20:55.968621Z","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-06-29T14:20:55.968621Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2605.28612","last_updated":"2026-05-27T15:26:16Z","snapshot_observed_at":"2026-08-03T21:00:41.368923Z","submitted_at":"2026-05-27T15:26:16Z","title":"Learning High-Dimensional Parity Functions with Product Networks using Gradient Descent","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-06-29T14:20:55.968621Z"},"links":{"citing_paper":"/paper/2605.28612"},"observation_digest":"sha256:333753c3f834559c7d98ef15e2ddcd5afdde6aeb30e3e27ea734f4ffeb809a70","observation_id":"6e0a96dd-f73f-44f2-a7b0-d1ab549f4a72","resolution":{"observed_at":"2026-06-29T14:20:55.968621Z","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-06-29T14:20:55.968621Z","title":"Since bounded updates force trajectories to traverse B before exiting the domain, and dynamics withinBprevent further descent below−1/4, the lower boundary is protected","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2605.28612","last_updated":"2026-05-27T15:26:16Z","snapshot_observed_at":"2026-08-03T21:00:41.368923Z","submitted_at":"2026-05-27T15:26:16Z","title":"Learning High-Dimensional Parity Functions with Product Networks using Gradient Descent","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-06-29T14:20:55.968621Z"},"links":{"citing_paper":"/paper/2605.28612"},"observation_digest":"sha256:89b2ec268555bb247f4ef5ceb98525a4bca7a74b5b9fab436ed5b6d03a4f5bfe","observation_id":"d34d0610-1029-4663-bf72-5cd0e88b4688","resolution":{"observed_at":"2026-06-29T14:20:55.968621Z","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-06-29T14:20:55.968621Z","title":"unfavorable","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2605.28612","last_updated":"2026-05-27T15:26:16Z","snapshot_observed_at":"2026-08-03T21:00:41.368923Z","submitted_at":"2026-05-27T15:26:16Z","title":"Learning High-Dimensional Parity Functions with Product Networks using Gradient Descent","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-06-29T14:20:55.968621Z"},"links":{"citing_paper":"/paper/2605.28612"},"observation_digest":"sha256:94adc4bd11882b25b0394f8d4fe72c873505c8e8b47565d833f44a1cab0b5cb1","observation_id":"32a736e4-1fb9-4ccc-b803-27aff20ece74","resolution":{"observed_at":"2026-06-29T14:20:55.968621Z","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-06-29T14:20:55.968621Z","title":"Case 1:x[k]>¯x max (outside envelope, above) Hered(x[k]) =x[k]−¯x max and¯x(x[k])≤¯xmax by definition","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2605.28612","last_updated":"2026-05-27T15:26:16Z","snapshot_observed_at":"2026-08-03T21:00:41.368923Z","submitted_at":"2026-05-27T15:26:16Z","title":"Learning High-Dimensional Parity Functions with Product Networks using Gradient Descent","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-06-29T14:20:55.968621Z"},"links":{"citing_paper":"/paper/2605.28612"},"observation_digest":"sha256:c712b616d0ae4b51a223f774dfbcc2959660b61b919f87c008c31b7b979cbf8c","observation_id":"9a6ec2f1-93bb-4ab8-9204-c511576be69a","resolution":{"observed_at":"2026-06-29T14:20:55.968621Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2605.28612","last_updated":"2026-05-27T15:26:16Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-03T21:00:41.368923Z","submitted_at":"2026-05-27T15:26:16Z","title":"Learning High-Dimensional Parity Functions with Product Networks using Gradient Descent"},"reference_resolution":{"displayed":14,"state_counts":{"malformed_identifier":2,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":9,"verified_exact":3,"verified_fuzzy":0},"total_outbound_references":14},"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-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 14 of 14 outbound references and 0 inbound Pith citation observations for arXiv:2605.28612."}