{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:BCFNVT7ATKZ3AOFNBS2H3ZI6UE","short_pith_number":"pith:BCFNVT7A","canonical_record":{"source":{"id":"1908.07215","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-08-20T08:25:14Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"d93e871c447d11a747356bc9732da3528db44ea64afeb799049bad7a2f577741","abstract_canon_sha256":"6f7f4c2a81f36d041e5871f4a1c909e32da6596bd335c78ff4fa58a104a78b27"},"schema_version":"1.0"},"canonical_sha256":"088adacfe09ab3b038ad0cb47de51ea1084105c3e8b181c2ed1d85afc335e437","source":{"kind":"arxiv","id":"1908.07215","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.07215","created_at":"2026-07-04T23:58:31Z"},{"alias_kind":"arxiv_version","alias_value":"1908.07215v1","created_at":"2026-07-04T23:58:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.07215","created_at":"2026-07-04T23:58:31Z"},{"alias_kind":"pith_short_12","alias_value":"BCFNVT7ATKZ3","created_at":"2026-07-04T23:58:31Z"},{"alias_kind":"pith_short_16","alias_value":"BCFNVT7ATKZ3AOFN","created_at":"2026-07-04T23:58:31Z"},{"alias_kind":"pith_short_8","alias_value":"BCFNVT7A","created_at":"2026-07-04T23:58:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:BCFNVT7ATKZ3AOFNBS2H3ZI6UE","target":"record","payload":{"canonical_record":{"source":{"id":"1908.07215","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-08-20T08:25:14Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"d93e871c447d11a747356bc9732da3528db44ea64afeb799049bad7a2f577741","abstract_canon_sha256":"6f7f4c2a81f36d041e5871f4a1c909e32da6596bd335c78ff4fa58a104a78b27"},"schema_version":"1.0"},"canonical_sha256":"088adacfe09ab3b038ad0cb47de51ea1084105c3e8b181c2ed1d85afc335e437","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:58:31.998413Z","signature_b64":"EyRzEPqSBnIiSkKnQGfDiVf9o/FxvzK4M8kiiurghMMW9tKmzh0KcYrcpCd8lqOWokKVQ8vjPitGnE9a1AF0AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"088adacfe09ab3b038ad0cb47de51ea1084105c3e8b181c2ed1d85afc335e437","last_reissued_at":"2026-07-04T23:58:31.998003Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:58:31.998003Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.07215","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-04T23:58:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nrde4GhHs0Cu6ri48p10WDM0mEfLvgN/Iv32WtDej2ojZ1lgQ9Ua9K8xeYKUcbHsagGmGl634vVbswjZtzgMCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T21:10:54.125132Z"},"content_sha256":"fdd232e99326f4c5536c0a779a8b3d51c166ce5bce74d2f8b3f03958f586c22f","schema_version":"1.0","event_id":"sha256:fdd232e99326f4c5536c0a779a8b3d51c166ce5bce74d2f8b3f03958f586c22f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:BCFNVT7ATKZ3AOFNBS2H3ZI6UE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Decoding Downset codes over a finite grid","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CC","authors_text":"Srikanth Srinivasan, S. Venkitesh, Utkarsh Tripathi","submitted_at":"2019-08-20T08:25:14Z","abstract_excerpt":"In a recent paper, Kim and Kopparty (Theory of Computing, 2017) gave a deterministic algorithm for the unique decoding problem for polynomials of bounded total degree over a general grid. We show that their algorithm can be adapted to solve the unique decoding problem for the general family of Downset codes. Here, a downset code is specified by a family D of monomials closed under taking factors: the corresponding code is the space of evaluations of all polynomials that can be written as linear combinations of monomials from D."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.07215","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.07215/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-04T23:58:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H+qSwAuOmKlwrVtNXvtGdHTU/L0JnIIKrK6zCMgXMrpr+mDt/kItpC8ajGJBlZZLKi2Wbx+sRalO+6naUqzzDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T21:10:54.125642Z"},"content_sha256":"894b3a31d06f140ab9a5a30b06b727b5bec554bd70c89e495fb2266c364bacb6","schema_version":"1.0","event_id":"sha256:894b3a31d06f140ab9a5a30b06b727b5bec554bd70c89e495fb2266c364bacb6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BCFNVT7ATKZ3AOFNBS2H3ZI6UE/bundle.json","state_url":"https://pith.science/pith/BCFNVT7ATKZ3AOFNBS2H3ZI6UE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BCFNVT7ATKZ3AOFNBS2H3ZI6UE/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-16T21:10:54Z","links":{"resolver":"https://pith.science/pith/BCFNVT7ATKZ3AOFNBS2H3ZI6UE","bundle":"https://pith.science/pith/BCFNVT7ATKZ3AOFNBS2H3ZI6UE/bundle.json","state":"https://pith.science/pith/BCFNVT7ATKZ3AOFNBS2H3ZI6UE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BCFNVT7ATKZ3AOFNBS2H3ZI6UE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:BCFNVT7ATKZ3AOFNBS2H3ZI6UE","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"6f7f4c2a81f36d041e5871f4a1c909e32da6596bd335c78ff4fa58a104a78b27","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-08-20T08:25:14Z","title_canon_sha256":"d93e871c447d11a747356bc9732da3528db44ea64afeb799049bad7a2f577741"},"schema_version":"1.0","source":{"id":"1908.07215","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.07215","created_at":"2026-07-04T23:58:31Z"},{"alias_kind":"arxiv_version","alias_value":"1908.07215v1","created_at":"2026-07-04T23:58:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.07215","created_at":"2026-07-04T23:58:31Z"},{"alias_kind":"pith_short_12","alias_value":"BCFNVT7ATKZ3","created_at":"2026-07-04T23:58:31Z"},{"alias_kind":"pith_short_16","alias_value":"BCFNVT7ATKZ3AOFN","created_at":"2026-07-04T23:58:31Z"},{"alias_kind":"pith_short_8","alias_value":"BCFNVT7A","created_at":"2026-07-04T23:58:31Z"}],"graph_snapshots":[{"event_id":"sha256:894b3a31d06f140ab9a5a30b06b727b5bec554bd70c89e495fb2266c364bacb6","target":"graph","created_at":"2026-07-04T23:58:31Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1908.07215/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In a recent paper, Kim and Kopparty (Theory of Computing, 2017) gave a deterministic algorithm for the unique decoding problem for polynomials of bounded total degree over a general grid. We show that their algorithm can be adapted to solve the unique decoding problem for the general family of Downset codes. Here, a downset code is specified by a family D of monomials closed under taking factors: the corresponding code is the space of evaluations of all polynomials that can be written as linear combinations of monomials from D.","authors_text":"Srikanth Srinivasan, S. Venkitesh, Utkarsh Tripathi","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-08-20T08:25:14Z","title":"Decoding Downset codes over a finite grid"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.07215","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:fdd232e99326f4c5536c0a779a8b3d51c166ce5bce74d2f8b3f03958f586c22f","target":"record","created_at":"2026-07-04T23:58:31Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"6f7f4c2a81f36d041e5871f4a1c909e32da6596bd335c78ff4fa58a104a78b27","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-08-20T08:25:14Z","title_canon_sha256":"d93e871c447d11a747356bc9732da3528db44ea64afeb799049bad7a2f577741"},"schema_version":"1.0","source":{"id":"1908.07215","kind":"arxiv","version":1}},"canonical_sha256":"088adacfe09ab3b038ad0cb47de51ea1084105c3e8b181c2ed1d85afc335e437","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"088adacfe09ab3b038ad0cb47de51ea1084105c3e8b181c2ed1d85afc335e437","first_computed_at":"2026-07-04T23:58:31.998003Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T23:58:31.998003Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EyRzEPqSBnIiSkKnQGfDiVf9o/FxvzK4M8kiiurghMMW9tKmzh0KcYrcpCd8lqOWokKVQ8vjPitGnE9a1AF0AQ==","signature_status":"signed_v1","signed_at":"2026-07-04T23:58:31.998413Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.07215","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fdd232e99326f4c5536c0a779a8b3d51c166ce5bce74d2f8b3f03958f586c22f","sha256:894b3a31d06f140ab9a5a30b06b727b5bec554bd70c89e495fb2266c364bacb6"],"state_sha256":"241b8abf14b8d1c43d6b2631b4816cf5857112f71b9ce2529364e55d8d0547fc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4x6rj+iBu/x2pU4JoQK0uXfHGLnUujGYDVgtGXTSv24aSjR+zEDcKvQyHcHiRA3Z+YVFyZMm/XncgAnA7549CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T21:10:54.130611Z","bundle_sha256":"f71399b877a2b9add990b132d13ac364b9881de0c26b2688325cfe821e8e904c"}}