{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:QWOAZRRCNM36X45WL3YHRKUBR2","short_pith_number":"pith:QWOAZRRC","canonical_record":{"source":{"id":"2606.02819","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-06-01T19:36:45Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"2d3d451ab01d709ecba00bc4e24e72676e26c2076faf19852084b83a9d332601","abstract_canon_sha256":"a605e925c73a6cab70dc5fedbc477f878aaee45aee378d400c5fbf1bfa270f60"},"schema_version":"1.0"},"canonical_sha256":"859c0cc6226b37ebf3b65ef078aa818e823e48c677b58adacfcb1ae5dd540c74","source":{"kind":"arxiv","id":"2606.02819","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.02819","created_at":"2026-06-03T01:05:23Z"},{"alias_kind":"arxiv_version","alias_value":"2606.02819v1","created_at":"2026-06-03T01:05:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.02819","created_at":"2026-06-03T01:05:23Z"},{"alias_kind":"pith_short_12","alias_value":"QWOAZRRCNM36","created_at":"2026-06-03T01:05:23Z"},{"alias_kind":"pith_short_16","alias_value":"QWOAZRRCNM36X45W","created_at":"2026-06-03T01:05:23Z"},{"alias_kind":"pith_short_8","alias_value":"QWOAZRRC","created_at":"2026-06-03T01:05:23Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:QWOAZRRCNM36X45WL3YHRKUBR2","target":"record","payload":{"canonical_record":{"source":{"id":"2606.02819","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-06-01T19:36:45Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"2d3d451ab01d709ecba00bc4e24e72676e26c2076faf19852084b83a9d332601","abstract_canon_sha256":"a605e925c73a6cab70dc5fedbc477f878aaee45aee378d400c5fbf1bfa270f60"},"schema_version":"1.0"},"canonical_sha256":"859c0cc6226b37ebf3b65ef078aa818e823e48c677b58adacfcb1ae5dd540c74","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-03T01:05:23.845205Z","signature_b64":"0Ek1p3KXdiGCCMPtEVrKrDOPcUkFT8lxWboczDrRx6M1RDydHHKZOkDFa3tDOgrjreriGlADf1ramGA/Los3Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"859c0cc6226b37ebf3b65ef078aa818e823e48c677b58adacfcb1ae5dd540c74","last_reissued_at":"2026-06-03T01:05:23.844826Z","signature_status":"signed_v1","first_computed_at":"2026-06-03T01:05:23.844826Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.02819","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-06-03T01:05:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1VSj66ryNNmi0tnsegRroDqYBJwkbDz3b/bMmE5xRjDpFmYIATktE7rJoN1laHvsg5+b1Vmlcc0IVZ1S9Y6bCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T19:12:28.262501Z"},"content_sha256":"6c81f40888badca7591c2bfa50c2aa387058b5b5b238f0852f82897f8b302cc4","schema_version":"1.0","event_id":"sha256:6c81f40888badca7591c2bfa50c2aa387058b5b5b238f0852f82897f8b302cc4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:QWOAZRRCNM36X45WL3YHRKUBR2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Reed-Muller type codes over a combinatorial simplex: an algebraic description","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hiram H. L\\'opez, Nart Shalqini, Rodrigo San-Jos\\'e","submitted_at":"2026-06-01T19:36:45Z","abstract_excerpt":"Given an ordered set $B$ of a finite field, a combinatorial simplex over $B$ is defined as the set of vectors such that the positions of the entries, with respect to $B$, sum up to a fixed integer. CAP codes are Reed-Muller type codes defined over a combinatorial simplex. They were recently introduced by Kopparty et al. as a high-rate alternative to classical Reed-Muller codes, capable of achieving arbitrarily high rates close to one for any fixed minimum distance. In this paper, we use tools from commutative algebra to analyze a combinatorial simplex and its associated CAP code. We give a uni"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.02819","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/2606.02819/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-06-03T01:05:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GfDaXPLRRr3XX4ymZYXbmdwwZZiPkdtKlrgPcrz+uO4lPVwSIz0nmf1PuW9OA/Io/tYlKtMOJK3Gd7q6y8dmCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T19:12:28.263006Z"},"content_sha256":"8690143e0ef0dfa6ca4d4c07a439e66adc0f0ba70f9e732836f4645d927fd2a4","schema_version":"1.0","event_id":"sha256:8690143e0ef0dfa6ca4d4c07a439e66adc0f0ba70f9e732836f4645d927fd2a4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QWOAZRRCNM36X45WL3YHRKUBR2/bundle.json","state_url":"https://pith.science/pith/QWOAZRRCNM36X45WL3YHRKUBR2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QWOAZRRCNM36X45WL3YHRKUBR2/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-06-09T19:12:28Z","links":{"resolver":"https://pith.science/pith/QWOAZRRCNM36X45WL3YHRKUBR2","bundle":"https://pith.science/pith/QWOAZRRCNM36X45WL3YHRKUBR2/bundle.json","state":"https://pith.science/pith/QWOAZRRCNM36X45WL3YHRKUBR2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QWOAZRRCNM36X45WL3YHRKUBR2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:QWOAZRRCNM36X45WL3YHRKUBR2","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":"a605e925c73a6cab70dc5fedbc477f878aaee45aee378d400c5fbf1bfa270f60","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-06-01T19:36:45Z","title_canon_sha256":"2d3d451ab01d709ecba00bc4e24e72676e26c2076faf19852084b83a9d332601"},"schema_version":"1.0","source":{"id":"2606.02819","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.02819","created_at":"2026-06-03T01:05:23Z"},{"alias_kind":"arxiv_version","alias_value":"2606.02819v1","created_at":"2026-06-03T01:05:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.02819","created_at":"2026-06-03T01:05:23Z"},{"alias_kind":"pith_short_12","alias_value":"QWOAZRRCNM36","created_at":"2026-06-03T01:05:23Z"},{"alias_kind":"pith_short_16","alias_value":"QWOAZRRCNM36X45W","created_at":"2026-06-03T01:05:23Z"},{"alias_kind":"pith_short_8","alias_value":"QWOAZRRC","created_at":"2026-06-03T01:05:23Z"}],"graph_snapshots":[{"event_id":"sha256:8690143e0ef0dfa6ca4d4c07a439e66adc0f0ba70f9e732836f4645d927fd2a4","target":"graph","created_at":"2026-06-03T01:05:23Z","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/2606.02819/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Given an ordered set $B$ of a finite field, a combinatorial simplex over $B$ is defined as the set of vectors such that the positions of the entries, with respect to $B$, sum up to a fixed integer. CAP codes are Reed-Muller type codes defined over a combinatorial simplex. They were recently introduced by Kopparty et al. as a high-rate alternative to classical Reed-Muller codes, capable of achieving arbitrarily high rates close to one for any fixed minimum distance. In this paper, we use tools from commutative algebra to analyze a combinatorial simplex and its associated CAP code. We give a uni","authors_text":"Hiram H. L\\'opez, Nart Shalqini, Rodrigo San-Jos\\'e","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-06-01T19:36:45Z","title":"Reed-Muller type codes over a combinatorial simplex: an algebraic description"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.02819","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:6c81f40888badca7591c2bfa50c2aa387058b5b5b238f0852f82897f8b302cc4","target":"record","created_at":"2026-06-03T01:05:23Z","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":"a605e925c73a6cab70dc5fedbc477f878aaee45aee378d400c5fbf1bfa270f60","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-06-01T19:36:45Z","title_canon_sha256":"2d3d451ab01d709ecba00bc4e24e72676e26c2076faf19852084b83a9d332601"},"schema_version":"1.0","source":{"id":"2606.02819","kind":"arxiv","version":1}},"canonical_sha256":"859c0cc6226b37ebf3b65ef078aa818e823e48c677b58adacfcb1ae5dd540c74","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"859c0cc6226b37ebf3b65ef078aa818e823e48c677b58adacfcb1ae5dd540c74","first_computed_at":"2026-06-03T01:05:23.844826Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-03T01:05:23.844826Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0Ek1p3KXdiGCCMPtEVrKrDOPcUkFT8lxWboczDrRx6M1RDydHHKZOkDFa3tDOgrjreriGlADf1ramGA/Los3Bg==","signature_status":"signed_v1","signed_at":"2026-06-03T01:05:23.845205Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.02819","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6c81f40888badca7591c2bfa50c2aa387058b5b5b238f0852f82897f8b302cc4","sha256:8690143e0ef0dfa6ca4d4c07a439e66adc0f0ba70f9e732836f4645d927fd2a4"],"state_sha256":"236b2b2bb1dd3ca3e0b3e4a94e65a991002025f8c14182116e1e374b9ac25a9b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5TeDqBlCrwTyR3tw8KFjNkZk2Z94/RHko9ZIrrhBGKJfocvRrbL291BH+VGuP/EDJV2WBJogb24UHthYKDH8Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T19:12:28.267507Z","bundle_sha256":"077f7c3159d5b7c781b4af0b5d9753dcb071c6fa94f8fba92b3cb0e7b8579216"}}