{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:WJK4WBYZSUZLGSRTBFWUL4QSN4","short_pith_number":"pith:WJK4WBYZ","canonical_record":{"source":{"id":"2604.11454","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2026-04-13T13:33:10Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"70752ee59ed1626f47189210d895c5eb6d0ba8c562c551fe4fea3c155c0af001","abstract_canon_sha256":"276fc5787dc1fdc9504cb0e15ed2ca763fcdb16d2a9e768d1c102242d3e343ca"},"schema_version":"1.0"},"canonical_sha256":"b255cb07199532b34a33096d45f2126f1ea9cfb7e20996161fafa6cdcbd321b7","source":{"kind":"arxiv","id":"2604.11454","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.11454","created_at":"2026-06-11T01:09:35Z"},{"alias_kind":"arxiv_version","alias_value":"2604.11454v2","created_at":"2026-06-11T01:09:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.11454","created_at":"2026-06-11T01:09:35Z"},{"alias_kind":"pith_short_12","alias_value":"WJK4WBYZSUZL","created_at":"2026-06-11T01:09:35Z"},{"alias_kind":"pith_short_16","alias_value":"WJK4WBYZSUZLGSRT","created_at":"2026-06-11T01:09:35Z"},{"alias_kind":"pith_short_8","alias_value":"WJK4WBYZ","created_at":"2026-06-11T01:09:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:WJK4WBYZSUZLGSRTBFWUL4QSN4","target":"record","payload":{"canonical_record":{"source":{"id":"2604.11454","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2026-04-13T13:33:10Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"70752ee59ed1626f47189210d895c5eb6d0ba8c562c551fe4fea3c155c0af001","abstract_canon_sha256":"276fc5787dc1fdc9504cb0e15ed2ca763fcdb16d2a9e768d1c102242d3e343ca"},"schema_version":"1.0"},"canonical_sha256":"b255cb07199532b34a33096d45f2126f1ea9cfb7e20996161fafa6cdcbd321b7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-11T01:09:35.191209Z","signature_b64":"IvI7pJU/fcQNbWim3ijsD+h9Rl8/NDTuxEd0NiQYbIp6QF/SCQksfnWCBklRiyduK4jiJNojBRhgHLP60Ga4Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b255cb07199532b34a33096d45f2126f1ea9cfb7e20996161fafa6cdcbd321b7","last_reissued_at":"2026-06-11T01:09:35.190279Z","signature_status":"signed_v1","first_computed_at":"2026-06-11T01:09:35.190279Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2604.11454","source_version":2,"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-11T01:09:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S87xpmbGYaDO6nkIq8ZOxCVxEUm9+kQPCAm2xP09gtPWYRj41svEVtbS9sYHl+OdG1hbAEcYR/i2ZQY3namfDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T02:10:41.565027Z"},"content_sha256":"8205d5b91fb2ad6b5f9a597e047033b1712ef28cda0f1cb4a820a5657ad0da27","schema_version":"1.0","event_id":"sha256:8205d5b91fb2ad6b5f9a597e047033b1712ef28cda0f1cb4a820a5657ad0da27"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:WJK4WBYZSUZLGSRTBFWUL4QSN4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Foundations of the GraphAlg Language","license":"http://creativecommons.org/licenses/by/4.0/","headline":"GraphAlg Core expressions can be simulated using simultaneous induction in an extended for-MATLANG.","cross_cats":["cs.PL"],"primary_cat":"cs.DB","authors_text":"Daan de Graaf, Nikolay Yakovets, Robert Brijder","submitted_at":"2026-04-13T13:33:10Z","abstract_excerpt":"The GraphAlg domain-specific language for graph algorithms enables user-defined algorithms in graph databases. In this work we show how GraphAlg is built on top of the formal MATLANG language for matrix manipulation. Starting from MATLANG, we describe the extensions to MATLANG and the syntactic sugar needed to derive GraphAlg. Furthermore, we prove that any GraphAlg program can be simulated in an extension of for-MATLANG that supports simultaneous induction."},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"Furthermore, we prove that any GraphAlg Core expression can be simulated in an extension of for-MATLANG that supports simultaneous induction.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That the extensions described to MATLANG are sufficient and faithful to capture the intended semantics of GraphAlg without omitting essential graph-specific features or introducing semantic gaps.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"GraphAlg Core is derived from MATLANG via extensions and any GraphAlg Core expression can be simulated in an extension of for-MATLANG supporting simultaneous induction.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"GraphAlg Core expressions can be simulated using simultaneous induction in an extended for-MATLANG.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"d16b976bb6681595ab76b5cfbcd6e818dafc1e747f0d9799e52c71cb4c79c084"},"source":{"id":"2604.11454","kind":"arxiv","version":2},"verdict":{"id":"f1c8ae7d-86e0-46f6-ac88-a4ea2666a504","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-10T15:50:23.533324Z","strongest_claim":"Furthermore, we prove that any GraphAlg Core expression can be simulated in an extension of for-MATLANG that supports simultaneous induction.","one_line_summary":"GraphAlg Core is derived from MATLANG via extensions and any GraphAlg Core expression can be simulated in an extension of for-MATLANG supporting simultaneous induction.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That the extensions described to MATLANG are sufficient and faithful to capture the intended semantics of GraphAlg without omitting essential graph-specific features or introducing semantic gaps.","pith_extraction_headline":"GraphAlg Core expressions can be simulated using simultaneous induction in an extended for-MATLANG."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2604.11454/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":"f1c8ae7d-86e0-46f6-ac88-a4ea2666a504"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-11T01:09:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iKC3B3jTSjuaVMK3wXEAP3Heu3qDdw92O+Td6XZShrUZxebdRA8XtwqOhYCqe+Tt+uu0uYp7FEM2M92A5B5UDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T02:10:41.565515Z"},"content_sha256":"993fb2e3ba54bf21ffb3d2d912ab93cbeb0ac26180abe7da386eee6e287080f2","schema_version":"1.0","event_id":"sha256:993fb2e3ba54bf21ffb3d2d912ab93cbeb0ac26180abe7da386eee6e287080f2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WJK4WBYZSUZLGSRTBFWUL4QSN4/bundle.json","state_url":"https://pith.science/pith/WJK4WBYZSUZLGSRTBFWUL4QSN4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WJK4WBYZSUZLGSRTBFWUL4QSN4/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-22T02:10:41Z","links":{"resolver":"https://pith.science/pith/WJK4WBYZSUZLGSRTBFWUL4QSN4","bundle":"https://pith.science/pith/WJK4WBYZSUZLGSRTBFWUL4QSN4/bundle.json","state":"https://pith.science/pith/WJK4WBYZSUZLGSRTBFWUL4QSN4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WJK4WBYZSUZLGSRTBFWUL4QSN4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:WJK4WBYZSUZLGSRTBFWUL4QSN4","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":"276fc5787dc1fdc9504cb0e15ed2ca763fcdb16d2a9e768d1c102242d3e343ca","cross_cats_sorted":["cs.PL"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2026-04-13T13:33:10Z","title_canon_sha256":"70752ee59ed1626f47189210d895c5eb6d0ba8c562c551fe4fea3c155c0af001"},"schema_version":"1.0","source":{"id":"2604.11454","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.11454","created_at":"2026-06-11T01:09:35Z"},{"alias_kind":"arxiv_version","alias_value":"2604.11454v2","created_at":"2026-06-11T01:09:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.11454","created_at":"2026-06-11T01:09:35Z"},{"alias_kind":"pith_short_12","alias_value":"WJK4WBYZSUZL","created_at":"2026-06-11T01:09:35Z"},{"alias_kind":"pith_short_16","alias_value":"WJK4WBYZSUZLGSRT","created_at":"2026-06-11T01:09:35Z"},{"alias_kind":"pith_short_8","alias_value":"WJK4WBYZ","created_at":"2026-06-11T01:09:35Z"}],"graph_snapshots":[{"event_id":"sha256:993fb2e3ba54bf21ffb3d2d912ab93cbeb0ac26180abe7da386eee6e287080f2","target":"graph","created_at":"2026-06-11T01:09:35Z","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":"Furthermore, we prove that any GraphAlg Core expression can be simulated in an extension of for-MATLANG that supports simultaneous induction."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That the extensions described to MATLANG are sufficient and faithful to capture the intended semantics of GraphAlg without omitting essential graph-specific features or introducing semantic gaps."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"GraphAlg Core is derived from MATLANG via extensions and any GraphAlg Core expression can be simulated in an extension of for-MATLANG supporting simultaneous induction."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"GraphAlg Core expressions can be simulated using simultaneous induction in an extended for-MATLANG."}],"snapshot_sha256":"d16b976bb6681595ab76b5cfbcd6e818dafc1e747f0d9799e52c71cb4c79c084"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2604.11454/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The GraphAlg domain-specific language for graph algorithms enables user-defined algorithms in graph databases. In this work we show how GraphAlg is built on top of the formal MATLANG language for matrix manipulation. Starting from MATLANG, we describe the extensions to MATLANG and the syntactic sugar needed to derive GraphAlg. Furthermore, we prove that any GraphAlg program can be simulated in an extension of for-MATLANG that supports simultaneous induction.","authors_text":"Daan de Graaf, Nikolay Yakovets, Robert Brijder","cross_cats":["cs.PL"],"headline":"GraphAlg Core expressions can be simulated using simultaneous induction in an extended for-MATLANG.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2026-04-13T13:33:10Z","title":"Foundations of the GraphAlg Language"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2604.11454","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-10T15:50:23.533324Z","id":"f1c8ae7d-86e0-46f6-ac88-a4ea2666a504","model_set":{"reader":"grok-4.3"},"one_line_summary":"GraphAlg Core is derived from MATLANG via extensions and any GraphAlg Core expression can be simulated in an extension of for-MATLANG supporting simultaneous induction.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"GraphAlg Core expressions can be simulated using simultaneous induction in an extended for-MATLANG.","strongest_claim":"Furthermore, we prove that any GraphAlg Core expression can be simulated in an extension of for-MATLANG that supports simultaneous induction.","weakest_assumption":"That the extensions described to MATLANG are sufficient and faithful to capture the intended semantics of GraphAlg without omitting essential graph-specific features or introducing semantic gaps."}},"verdict_id":"f1c8ae7d-86e0-46f6-ac88-a4ea2666a504"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:8205d5b91fb2ad6b5f9a597e047033b1712ef28cda0f1cb4a820a5657ad0da27","target":"record","created_at":"2026-06-11T01:09:35Z","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":"276fc5787dc1fdc9504cb0e15ed2ca763fcdb16d2a9e768d1c102242d3e343ca","cross_cats_sorted":["cs.PL"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2026-04-13T13:33:10Z","title_canon_sha256":"70752ee59ed1626f47189210d895c5eb6d0ba8c562c551fe4fea3c155c0af001"},"schema_version":"1.0","source":{"id":"2604.11454","kind":"arxiv","version":2}},"canonical_sha256":"b255cb07199532b34a33096d45f2126f1ea9cfb7e20996161fafa6cdcbd321b7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b255cb07199532b34a33096d45f2126f1ea9cfb7e20996161fafa6cdcbd321b7","first_computed_at":"2026-06-11T01:09:35.190279Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-11T01:09:35.190279Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IvI7pJU/fcQNbWim3ijsD+h9Rl8/NDTuxEd0NiQYbIp6QF/SCQksfnWCBklRiyduK4jiJNojBRhgHLP60Ga4Aw==","signature_status":"signed_v1","signed_at":"2026-06-11T01:09:35.191209Z","signed_message":"canonical_sha256_bytes"},"source_id":"2604.11454","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8205d5b91fb2ad6b5f9a597e047033b1712ef28cda0f1cb4a820a5657ad0da27","sha256:993fb2e3ba54bf21ffb3d2d912ab93cbeb0ac26180abe7da386eee6e287080f2"],"state_sha256":"68fa59139af9c8fdd636aeee7c9848af45a495101b7443ab3a5ac9cb4089a31e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FdU5FlBBwV+VB07ZAGY4D2NhW04oGoQX/HaC+SPVPyxnVZDju9rADXVDVUmERQGCqcTYf/PAzEv/q5dgPS5gAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T02:10:41.567814Z","bundle_sha256":"0c96e277881ff33136171d9a5bffa8483a4078ddf497e3534b30d0b8bda23a4c"}}