{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:RMUMZSU3S67L4G4JOFR3KJAW5S","short_pith_number":"pith:RMUMZSU3","canonical_record":{"source":{"id":"2603.17627","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2026-03-18T11:47:15Z","cross_cats_sorted":["cs.AR"],"title_canon_sha256":"a13b366be98c2c4de085536363358fd2dd41ea99006c82dce52930a07fe7e2f7","abstract_canon_sha256":"9c4b116871976320cc1c94a60acbf8443636216c5500dfa7c5e08c3d70dfbd3e"},"schema_version":"1.0"},"canonical_sha256":"8b28ccca9b97bebe1b897163b52416ec91f9df829722ae5d99d6aacee3491de7","source":{"kind":"arxiv","id":"2603.17627","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2603.17627","created_at":"2026-06-19T16:09:56Z"},{"alias_kind":"arxiv_version","alias_value":"2603.17627v4","created_at":"2026-06-19T16:09:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.17627","created_at":"2026-06-19T16:09:56Z"},{"alias_kind":"pith_short_12","alias_value":"RMUMZSU3S67L","created_at":"2026-06-19T16:09:56Z"},{"alias_kind":"pith_short_16","alias_value":"RMUMZSU3S67L4G4J","created_at":"2026-06-19T16:09:56Z"},{"alias_kind":"pith_short_8","alias_value":"RMUMZSU3","created_at":"2026-06-19T16:09:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:RMUMZSU3S67L4G4JOFR3KJAW5S","target":"record","payload":{"canonical_record":{"source":{"id":"2603.17627","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2026-03-18T11:47:15Z","cross_cats_sorted":["cs.AR"],"title_canon_sha256":"a13b366be98c2c4de085536363358fd2dd41ea99006c82dce52930a07fe7e2f7","abstract_canon_sha256":"9c4b116871976320cc1c94a60acbf8443636216c5500dfa7c5e08c3d70dfbd3e"},"schema_version":"1.0"},"canonical_sha256":"8b28ccca9b97bebe1b897163b52416ec91f9df829722ae5d99d6aacee3491de7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-19T16:09:56.852249Z","signature_b64":"YL1aZqPacRJdcGPnBt7PdsHkYGkwHb8qB49QESBU3vCU2+uuB2y+TapsIP+BGL1nTTEzb6vhJAyb475L35S8Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8b28ccca9b97bebe1b897163b52416ec91f9df829722ae5d99d6aacee3491de7","last_reissued_at":"2026-06-19T16:09:56.851720Z","signature_status":"signed_v1","first_computed_at":"2026-06-19T16:09:56.851720Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2603.17627","source_version":4,"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-19T16:09:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PS6qo9M5vK9xGLfpoZN2LPQZYIKWzB4Uibmaxxbf5+X7PtV4al4tEoTcumrrsbXBMCshXiWxyq2YJAV57xBQAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T05:45:58.014900Z"},"content_sha256":"6f55156ac0af2908ff085b10c09bb0ad1f34f6fdb2e16aec5e07524ff06408e7","schema_version":"1.0","event_id":"sha256:6f55156ac0af2908ff085b10c09bb0ad1f34f6fdb2e16aec5e07524ff06408e7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:RMUMZSU3S67L4G4JOFR3KJAW5S","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Program Hypergraph: Multi-Way Relational Structure for Geometric Algebra, Spatial Compute, and Physics-Aware Compilation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"The Program Hypergraph generalizes binary semantic graphs to arbitrary-arity hyperedges to natively represent geometric algebra and spatial dataflow constraints.","cross_cats":["cs.AR"],"primary_cat":"cs.PL","authors_text":"Houston Haynes","submitted_at":"2026-03-18T11:47:15Z","abstract_excerpt":"The Program Semantic Graph (PSG) introduced in prior work on Dimensional Type Systems and Deterministic Memory Management encodes compilation-relevant properties as binary edge relations between computation nodes. This representation is adequate for scalar and tensor computations, but becomes structurally insufficient for two classes of problems central to heterogeneous compute: tile co-location and routing constraints in spatial dataflow architectures, which are inherently multi-way; and geometric algebra computation, where graded multi-way products cannot be faithfully represented as sequenc"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We demonstrate that grade in Clifford algebra is a natural dimension axis within the existing DTS abelian group framework, that grade inference derives geometric product sparsity eliminating the primary performance objection to Clifford algebra neural networks without manual specialization, and that the k-simplex structure of mesh topology is a direct instance of the hyperedge formalism.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That promoting binary edges to hyperedges of arbitrary arity preserves algebraic identity and enables joint derivation of geometric correctness, memory placement, numerical precision, and hardware partitioning inside the Fidelity framework without introducing new performance or correctness costs.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"The Program Hypergraph extends binary program semantic graphs to arbitrary-arity hyperedges to faithfully represent multi-way relations in geometric algebra and spatial architectures.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"The Program Hypergraph generalizes binary semantic graphs to arbitrary-arity hyperedges to natively represent geometric algebra and spatial dataflow constraints.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"63878f6fff43be786d470f19e585da7ca4164b82d2132323590eb642dfe6f067"},"source":{"id":"2603.17627","kind":"arxiv","version":4},"verdict":{"id":"7991bede-12e6-47b5-bef5-7d2e3680d277","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-15T08:39:34.857667Z","strongest_claim":"We demonstrate that grade in Clifford algebra is a natural dimension axis within the existing DTS abelian group framework, that grade inference derives geometric product sparsity eliminating the primary performance objection to Clifford algebra neural networks without manual specialization, and that the k-simplex structure of mesh topology is a direct instance of the hyperedge formalism.","one_line_summary":"The Program Hypergraph extends binary program semantic graphs to arbitrary-arity hyperedges to faithfully represent multi-way relations in geometric algebra and spatial architectures.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That promoting binary edges to hyperedges of arbitrary arity preserves algebraic identity and enables joint derivation of geometric correctness, memory placement, numerical precision, and hardware partitioning inside the Fidelity framework without introducing new performance or correctness costs.","pith_extraction_headline":"The Program Hypergraph generalizes binary semantic graphs to arbitrary-arity hyperedges to natively represent geometric algebra and spatial dataflow constraints."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2603.17627/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":2,"snapshot_sha256":"1f428f0b4d294f25b652ad1b88d4b49be04c3a1e6bc70d902645a4520ce96b02"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"7991bede-12e6-47b5-bef5-7d2e3680d277"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-19T16:09:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OJPvxCzM9v6tre/M5jkF1drhzQyLPhxP6TSABwYN70X6Wc10qQhXp9SEGJWsuWfq3SQ84bC5ZY65ZM7BNTEyDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T05:45:58.015398Z"},"content_sha256":"e0403244658ef90d9d77af6bc4ea21c7d905141a3da248525513ba8ef3388bea","schema_version":"1.0","event_id":"sha256:e0403244658ef90d9d77af6bc4ea21c7d905141a3da248525513ba8ef3388bea"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RMUMZSU3S67L4G4JOFR3KJAW5S/bundle.json","state_url":"https://pith.science/pith/RMUMZSU3S67L4G4JOFR3KJAW5S/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RMUMZSU3S67L4G4JOFR3KJAW5S/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-07-06T05:45:58Z","links":{"resolver":"https://pith.science/pith/RMUMZSU3S67L4G4JOFR3KJAW5S","bundle":"https://pith.science/pith/RMUMZSU3S67L4G4JOFR3KJAW5S/bundle.json","state":"https://pith.science/pith/RMUMZSU3S67L4G4JOFR3KJAW5S/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RMUMZSU3S67L4G4JOFR3KJAW5S/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:RMUMZSU3S67L4G4JOFR3KJAW5S","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":"9c4b116871976320cc1c94a60acbf8443636216c5500dfa7c5e08c3d70dfbd3e","cross_cats_sorted":["cs.AR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2026-03-18T11:47:15Z","title_canon_sha256":"a13b366be98c2c4de085536363358fd2dd41ea99006c82dce52930a07fe7e2f7"},"schema_version":"1.0","source":{"id":"2603.17627","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2603.17627","created_at":"2026-06-19T16:09:56Z"},{"alias_kind":"arxiv_version","alias_value":"2603.17627v4","created_at":"2026-06-19T16:09:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.17627","created_at":"2026-06-19T16:09:56Z"},{"alias_kind":"pith_short_12","alias_value":"RMUMZSU3S67L","created_at":"2026-06-19T16:09:56Z"},{"alias_kind":"pith_short_16","alias_value":"RMUMZSU3S67L4G4J","created_at":"2026-06-19T16:09:56Z"},{"alias_kind":"pith_short_8","alias_value":"RMUMZSU3","created_at":"2026-06-19T16:09:56Z"}],"graph_snapshots":[{"event_id":"sha256:e0403244658ef90d9d77af6bc4ea21c7d905141a3da248525513ba8ef3388bea","target":"graph","created_at":"2026-06-19T16:09:56Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"We demonstrate that grade in Clifford algebra is a natural dimension axis within the existing DTS abelian group framework, that grade inference derives geometric product sparsity eliminating the primary performance objection to Clifford algebra neural networks without manual specialization, and that the k-simplex structure of mesh topology is a direct instance of the hyperedge formalism."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That promoting binary edges to hyperedges of arbitrary arity preserves algebraic identity and enables joint derivation of geometric correctness, memory placement, numerical precision, and hardware partitioning inside the Fidelity framework without introducing new performance or correctness costs."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"The Program Hypergraph extends binary program semantic graphs to arbitrary-arity hyperedges to faithfully represent multi-way relations in geometric algebra and spatial architectures."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"The Program Hypergraph generalizes binary semantic graphs to arbitrary-arity hyperedges to natively represent geometric algebra and spatial dataflow constraints."}],"snapshot_sha256":"63878f6fff43be786d470f19e585da7ca4164b82d2132323590eb642dfe6f067"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"1f428f0b4d294f25b652ad1b88d4b49be04c3a1e6bc70d902645a4520ce96b02"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2603.17627/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The Program Semantic Graph (PSG) introduced in prior work on Dimensional Type Systems and Deterministic Memory Management encodes compilation-relevant properties as binary edge relations between computation nodes. This representation is adequate for scalar and tensor computations, but becomes structurally insufficient for two classes of problems central to heterogeneous compute: tile co-location and routing constraints in spatial dataflow architectures, which are inherently multi-way; and geometric algebra computation, where graded multi-way products cannot be faithfully represented as sequenc","authors_text":"Houston Haynes","cross_cats":["cs.AR"],"headline":"The Program Hypergraph generalizes binary semantic graphs to arbitrary-arity hyperedges to natively represent geometric algebra and spatial dataflow constraints.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2026-03-18T11:47:15Z","title":"The Program Hypergraph: Multi-Way Relational Structure for Geometric Algebra, Spatial Compute, and Physics-Aware Compilation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2603.17627","kind":"arxiv","version":4},"verdict":{"created_at":"2026-05-15T08:39:34.857667Z","id":"7991bede-12e6-47b5-bef5-7d2e3680d277","model_set":{"reader":"grok-4.3"},"one_line_summary":"The Program Hypergraph extends binary program semantic graphs to arbitrary-arity hyperedges to faithfully represent multi-way relations in geometric algebra and spatial architectures.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"The Program Hypergraph generalizes binary semantic graphs to arbitrary-arity hyperedges to natively represent geometric algebra and spatial dataflow constraints.","strongest_claim":"We demonstrate that grade in Clifford algebra is a natural dimension axis within the existing DTS abelian group framework, that grade inference derives geometric product sparsity eliminating the primary performance objection to Clifford algebra neural networks without manual specialization, and that the k-simplex structure of mesh topology is a direct instance of the hyperedge formalism.","weakest_assumption":"That promoting binary edges to hyperedges of arbitrary arity preserves algebraic identity and enables joint derivation of geometric correctness, memory placement, numerical precision, and hardware partitioning inside the Fidelity framework without introducing new performance or correctness costs."}},"verdict_id":"7991bede-12e6-47b5-bef5-7d2e3680d277"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:6f55156ac0af2908ff085b10c09bb0ad1f34f6fdb2e16aec5e07524ff06408e7","target":"record","created_at":"2026-06-19T16:09:56Z","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":"9c4b116871976320cc1c94a60acbf8443636216c5500dfa7c5e08c3d70dfbd3e","cross_cats_sorted":["cs.AR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2026-03-18T11:47:15Z","title_canon_sha256":"a13b366be98c2c4de085536363358fd2dd41ea99006c82dce52930a07fe7e2f7"},"schema_version":"1.0","source":{"id":"2603.17627","kind":"arxiv","version":4}},"canonical_sha256":"8b28ccca9b97bebe1b897163b52416ec91f9df829722ae5d99d6aacee3491de7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8b28ccca9b97bebe1b897163b52416ec91f9df829722ae5d99d6aacee3491de7","first_computed_at":"2026-06-19T16:09:56.851720Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-19T16:09:56.851720Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YL1aZqPacRJdcGPnBt7PdsHkYGkwHb8qB49QESBU3vCU2+uuB2y+TapsIP+BGL1nTTEzb6vhJAyb475L35S8Bg==","signature_status":"signed_v1","signed_at":"2026-06-19T16:09:56.852249Z","signed_message":"canonical_sha256_bytes"},"source_id":"2603.17627","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6f55156ac0af2908ff085b10c09bb0ad1f34f6fdb2e16aec5e07524ff06408e7","sha256:e0403244658ef90d9d77af6bc4ea21c7d905141a3da248525513ba8ef3388bea"],"state_sha256":"94872d2528643c527d931e59819659b8981d890c04187ce9d699e58b425c309a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MCpp7ejUtb0tGoz1P6ddpz+zZ7kzDgPBnRRPBfH/8S+sX4I7ZLI67egsbX9l+HMQJe/GeAAkFoy80VDVxo3ICQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T05:45:58.017884Z","bundle_sha256":"439be513ecdedaffb99931affdf97507ee8c38fdaee92c73a40d2ae60f8fc36a"}}