{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:ZSRJCI3TDQZNHCNGOB77NDTCCZ","short_pith_number":"pith:ZSRJCI3T","canonical_record":{"source":{"id":"2606.03101","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.AC","submitted_at":"2026-06-02T03:39:24Z","cross_cats_sorted":[],"title_canon_sha256":"94ee575718857cf79832353c837c71e9f471323da9d0b16b95656b10986a2938","abstract_canon_sha256":"ebe90bf0a9b40c1dce198bd6c5dc31e56374ffc48b5bb7ef6ac410d02e3ba290"},"schema_version":"1.0"},"canonical_sha256":"cca29123731c32d389a6707ff68e62167b3b73d2b9892d4954106699adb1f89f","source":{"kind":"arxiv","id":"2606.03101","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.03101","created_at":"2026-06-03T01:05:31Z"},{"alias_kind":"arxiv_version","alias_value":"2606.03101v1","created_at":"2026-06-03T01:05:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.03101","created_at":"2026-06-03T01:05:31Z"},{"alias_kind":"pith_short_12","alias_value":"ZSRJCI3TDQZN","created_at":"2026-06-03T01:05:31Z"},{"alias_kind":"pith_short_16","alias_value":"ZSRJCI3TDQZNHCNG","created_at":"2026-06-03T01:05:31Z"},{"alias_kind":"pith_short_8","alias_value":"ZSRJCI3T","created_at":"2026-06-03T01:05:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:ZSRJCI3TDQZNHCNGOB77NDTCCZ","target":"record","payload":{"canonical_record":{"source":{"id":"2606.03101","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.AC","submitted_at":"2026-06-02T03:39:24Z","cross_cats_sorted":[],"title_canon_sha256":"94ee575718857cf79832353c837c71e9f471323da9d0b16b95656b10986a2938","abstract_canon_sha256":"ebe90bf0a9b40c1dce198bd6c5dc31e56374ffc48b5bb7ef6ac410d02e3ba290"},"schema_version":"1.0"},"canonical_sha256":"cca29123731c32d389a6707ff68e62167b3b73d2b9892d4954106699adb1f89f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-03T01:05:31.703065Z","signature_b64":"VfXIprCJDNGppK63e0jktj5xSQ7d4pFT7I/ayefVv/9jFv9VXEJPV5SLAB1r9GY6NalVlghGk9LtV0u2LdHaAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cca29123731c32d389a6707ff68e62167b3b73d2b9892d4954106699adb1f89f","last_reissued_at":"2026-06-03T01:05:31.702700Z","signature_status":"signed_v1","first_computed_at":"2026-06-03T01:05:31.702700Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.03101","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:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Dw9a6R0xWvzdd2XDN6ewuJzdxJZKnY3n2NcxqO4JntJgHlzk5380BBZ/mOYS7fyu1/CiCtmROwfncT4yIbavCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T09:00:00.081540Z"},"content_sha256":"ab694d27ee7cc32d90659a1d3aafb97fccb0d5540a13cde14340d5bf0b81217d","schema_version":"1.0","event_id":"sha256:ab694d27ee7cc32d90659a1d3aafb97fccb0d5540a13cde14340d5bf0b81217d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:ZSRJCI3TDQZNHCNGOB77NDTCCZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Betti numbers of split graphs","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.AC","authors_text":"Ralf Fr\\\"oberg","submitted_at":"2026-06-02T03:39:24Z","abstract_excerpt":"A split graph is a graph where the vertices are a disjoint union of a complete part $C=\\{x_i,\\ldots,x_n\\}$ and a stable part $S=\\{y_1,\\ldots,y_m\\}$. We will determine the Betti numbers of the edge ring of all split graphs, in particular show that the only nonzero Betti numbers are $\\beta_{0,0}$ and $\\beta_{i,i+1}$, $i>0$. The Betti numbers only depend on the multiset of the number of neighbors in $S$ the $x_i$'s have. Singh and Verma have earlier determined the Betti numbers for complete split graphs (where all $y_i$ are neighbors to all $x_j$), and for \"nearly complete\" split graphs (where al"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.03101","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.03101/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:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B6PUcBfS+uBd+dYg/9vm3MtUpK7Bs8eov+dLEUEoi6FaxGtj1apv58pz7fyKa2jlATSoEioe6YcE7DFl0we7BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T09:00:00.081902Z"},"content_sha256":"dfa73ad572d872e002dc4ee2f7dacfe2cc91b9302b20b9ba9885c312080dabc7","schema_version":"1.0","event_id":"sha256:dfa73ad572d872e002dc4ee2f7dacfe2cc91b9302b20b9ba9885c312080dabc7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZSRJCI3TDQZNHCNGOB77NDTCCZ/bundle.json","state_url":"https://pith.science/pith/ZSRJCI3TDQZNHCNGOB77NDTCCZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZSRJCI3TDQZNHCNGOB77NDTCCZ/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-03T09:00:00Z","links":{"resolver":"https://pith.science/pith/ZSRJCI3TDQZNHCNGOB77NDTCCZ","bundle":"https://pith.science/pith/ZSRJCI3TDQZNHCNGOB77NDTCCZ/bundle.json","state":"https://pith.science/pith/ZSRJCI3TDQZNHCNGOB77NDTCCZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZSRJCI3TDQZNHCNGOB77NDTCCZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:ZSRJCI3TDQZNHCNGOB77NDTCCZ","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":"ebe90bf0a9b40c1dce198bd6c5dc31e56374ffc48b5bb7ef6ac410d02e3ba290","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.AC","submitted_at":"2026-06-02T03:39:24Z","title_canon_sha256":"94ee575718857cf79832353c837c71e9f471323da9d0b16b95656b10986a2938"},"schema_version":"1.0","source":{"id":"2606.03101","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.03101","created_at":"2026-06-03T01:05:31Z"},{"alias_kind":"arxiv_version","alias_value":"2606.03101v1","created_at":"2026-06-03T01:05:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.03101","created_at":"2026-06-03T01:05:31Z"},{"alias_kind":"pith_short_12","alias_value":"ZSRJCI3TDQZN","created_at":"2026-06-03T01:05:31Z"},{"alias_kind":"pith_short_16","alias_value":"ZSRJCI3TDQZNHCNG","created_at":"2026-06-03T01:05:31Z"},{"alias_kind":"pith_short_8","alias_value":"ZSRJCI3T","created_at":"2026-06-03T01:05:31Z"}],"graph_snapshots":[{"event_id":"sha256:dfa73ad572d872e002dc4ee2f7dacfe2cc91b9302b20b9ba9885c312080dabc7","target":"graph","created_at":"2026-06-03T01:05: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/2606.03101/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A split graph is a graph where the vertices are a disjoint union of a complete part $C=\\{x_i,\\ldots,x_n\\}$ and a stable part $S=\\{y_1,\\ldots,y_m\\}$. We will determine the Betti numbers of the edge ring of all split graphs, in particular show that the only nonzero Betti numbers are $\\beta_{0,0}$ and $\\beta_{i,i+1}$, $i>0$. The Betti numbers only depend on the multiset of the number of neighbors in $S$ the $x_i$'s have. Singh and Verma have earlier determined the Betti numbers for complete split graphs (where all $y_i$ are neighbors to all $x_j$), and for \"nearly complete\" split graphs (where al","authors_text":"Ralf Fr\\\"oberg","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.AC","submitted_at":"2026-06-02T03:39:24Z","title":"Betti numbers of split graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.03101","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:ab694d27ee7cc32d90659a1d3aafb97fccb0d5540a13cde14340d5bf0b81217d","target":"record","created_at":"2026-06-03T01:05: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":"ebe90bf0a9b40c1dce198bd6c5dc31e56374ffc48b5bb7ef6ac410d02e3ba290","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.AC","submitted_at":"2026-06-02T03:39:24Z","title_canon_sha256":"94ee575718857cf79832353c837c71e9f471323da9d0b16b95656b10986a2938"},"schema_version":"1.0","source":{"id":"2606.03101","kind":"arxiv","version":1}},"canonical_sha256":"cca29123731c32d389a6707ff68e62167b3b73d2b9892d4954106699adb1f89f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cca29123731c32d389a6707ff68e62167b3b73d2b9892d4954106699adb1f89f","first_computed_at":"2026-06-03T01:05:31.702700Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-03T01:05:31.702700Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VfXIprCJDNGppK63e0jktj5xSQ7d4pFT7I/ayefVv/9jFv9VXEJPV5SLAB1r9GY6NalVlghGk9LtV0u2LdHaAA==","signature_status":"signed_v1","signed_at":"2026-06-03T01:05:31.703065Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.03101","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ab694d27ee7cc32d90659a1d3aafb97fccb0d5540a13cde14340d5bf0b81217d","sha256:dfa73ad572d872e002dc4ee2f7dacfe2cc91b9302b20b9ba9885c312080dabc7"],"state_sha256":"d94dc67e367db88db7d678a016358c840fe2d4454fc69b5ae6e44b82daa2d3f5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eTiY92mv8q3B+PyLpcpyJTOBoTGpLAxkzGGV/QEuLz2GY/B0Di/qFUil5y49wnLz5iBztH2GBjiiErYus9CTDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-03T09:00:00.083894Z","bundle_sha256":"c6d66e976fae259d317fa770248f95a8cdf50fa91966b6cc9e6c82c66b9cc3fb"}}