{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:KC4RGHHXGI6GBU7B55LPUILNRS","short_pith_number":"pith:KC4RGHHX","canonical_record":{"source":{"id":"2605.22808","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-21T17:57:09Z","cross_cats_sorted":[],"title_canon_sha256":"a1f157178fa2c6e0c10732b51fb036c83ba3b10e5bbf19a9ea1463f65c9585a4","abstract_canon_sha256":"489f85e9ffc460ecce82df27a05a998f8ed76ae4f461dce9da4e8845adb92aa8"},"schema_version":"1.0"},"canonical_sha256":"50b9131cf7323c60d3e1ef56fa216d8c9a0d17503c4bd57a72680b44d71d9214","source":{"kind":"arxiv","id":"2605.22808","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.22808","created_at":"2026-05-22T02:04:55Z"},{"alias_kind":"arxiv_version","alias_value":"2605.22808v1","created_at":"2026-05-22T02:04:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.22808","created_at":"2026-05-22T02:04:55Z"},{"alias_kind":"pith_short_12","alias_value":"KC4RGHHXGI6G","created_at":"2026-05-22T02:04:55Z"},{"alias_kind":"pith_short_16","alias_value":"KC4RGHHXGI6GBU7B","created_at":"2026-05-22T02:04:55Z"},{"alias_kind":"pith_short_8","alias_value":"KC4RGHHX","created_at":"2026-05-22T02:04:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:KC4RGHHXGI6GBU7B55LPUILNRS","target":"record","payload":{"canonical_record":{"source":{"id":"2605.22808","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-21T17:57:09Z","cross_cats_sorted":[],"title_canon_sha256":"a1f157178fa2c6e0c10732b51fb036c83ba3b10e5bbf19a9ea1463f65c9585a4","abstract_canon_sha256":"489f85e9ffc460ecce82df27a05a998f8ed76ae4f461dce9da4e8845adb92aa8"},"schema_version":"1.0"},"canonical_sha256":"50b9131cf7323c60d3e1ef56fa216d8c9a0d17503c4bd57a72680b44d71d9214","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-22T02:04:55.708589Z","signature_b64":"SF6QIllC1EebFecv8+1yE3dj2C5on21DwRYjN9zTLBulPY3Sj5kjd61UMif/3gc/7ZUEonkLXCKqTyHGG1u9Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"50b9131cf7323c60d3e1ef56fa216d8c9a0d17503c4bd57a72680b44d71d9214","last_reissued_at":"2026-05-22T02:04:55.708101Z","signature_status":"signed_v1","first_computed_at":"2026-05-22T02:04:55.708101Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.22808","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-05-22T02:04:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4Nvb37bi1RVdNAkgd2P5kBJaW4yDVMByacyS8pwzzZDuRIe3Rg/NevRSfZ0MJfVGveWk/V2lQYXQwvyBfZoeAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T20:45:59.627686Z"},"content_sha256":"a89af791b2a164b37412b7e994e6ab93d98f2fdb2a7f5320043226a656888549","schema_version":"1.0","event_id":"sha256:a89af791b2a164b37412b7e994e6ab93d98f2fdb2a7f5320043226a656888549"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:KC4RGHHXGI6GBU7B55LPUILNRS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Betti Numbers of Cut Complexes of Squared Paths and a Recurrence Conjecture","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Yaoran Yang, Yutong Zhang","submitted_at":"2026-05-21T17:57:09Z","abstract_excerpt":"For a graph $G$ on $[n]$, the $k$-cut complex $\\Delta_k(G)$ has facets $[n]\\setminus T$, where $T$ ranges over the disconnected $k$-vertex induced subgraphs of $G$. Bayer, Denker, Jeli\\'c Milutinovi\\'c, Sundaram, and Xue proved that the $k$-cut complex of the squared path $P_n^2$ is shellable for $n\\ge k+3$ and conjectured a finite-difference recurrence for its top reduced Betti number along every diagonal $n-k=r$. We prove the recurrence by giving the exact formula $\\beta(k,n)=\\binom{n-1}{k-1}-\\sum_{j=0}^{\\min\\{k-1,n-k\\}}\\binom{k-1}{j}(n-k-j+1)+(n-k)$ for $r=n-k\\ge3$. Equivalently, for fixed "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.22808","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/2605.22808/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-05-22T02:04:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A4ivQJcBcAPsi3aiuYqzj4zK6zDFJuCuPJ7wjbV9caz1aS2piFh8g2NLHTYl5mpVoCnFON+iVNV2NR50fpMWCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T20:45:59.628093Z"},"content_sha256":"27c7106aada09b987faf5275ea4c85cbd51c28dabf17e7e60d3cd9e90c485887","schema_version":"1.0","event_id":"sha256:27c7106aada09b987faf5275ea4c85cbd51c28dabf17e7e60d3cd9e90c485887"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KC4RGHHXGI6GBU7B55LPUILNRS/bundle.json","state_url":"https://pith.science/pith/KC4RGHHXGI6GBU7B55LPUILNRS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KC4RGHHXGI6GBU7B55LPUILNRS/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-02T20:45:59Z","links":{"resolver":"https://pith.science/pith/KC4RGHHXGI6GBU7B55LPUILNRS","bundle":"https://pith.science/pith/KC4RGHHXGI6GBU7B55LPUILNRS/bundle.json","state":"https://pith.science/pith/KC4RGHHXGI6GBU7B55LPUILNRS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KC4RGHHXGI6GBU7B55LPUILNRS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:KC4RGHHXGI6GBU7B55LPUILNRS","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":"489f85e9ffc460ecce82df27a05a998f8ed76ae4f461dce9da4e8845adb92aa8","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-21T17:57:09Z","title_canon_sha256":"a1f157178fa2c6e0c10732b51fb036c83ba3b10e5bbf19a9ea1463f65c9585a4"},"schema_version":"1.0","source":{"id":"2605.22808","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.22808","created_at":"2026-05-22T02:04:55Z"},{"alias_kind":"arxiv_version","alias_value":"2605.22808v1","created_at":"2026-05-22T02:04:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.22808","created_at":"2026-05-22T02:04:55Z"},{"alias_kind":"pith_short_12","alias_value":"KC4RGHHXGI6G","created_at":"2026-05-22T02:04:55Z"},{"alias_kind":"pith_short_16","alias_value":"KC4RGHHXGI6GBU7B","created_at":"2026-05-22T02:04:55Z"},{"alias_kind":"pith_short_8","alias_value":"KC4RGHHX","created_at":"2026-05-22T02:04:55Z"}],"graph_snapshots":[{"event_id":"sha256:27c7106aada09b987faf5275ea4c85cbd51c28dabf17e7e60d3cd9e90c485887","target":"graph","created_at":"2026-05-22T02:04:55Z","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/2605.22808/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"For a graph $G$ on $[n]$, the $k$-cut complex $\\Delta_k(G)$ has facets $[n]\\setminus T$, where $T$ ranges over the disconnected $k$-vertex induced subgraphs of $G$. Bayer, Denker, Jeli\\'c Milutinovi\\'c, Sundaram, and Xue proved that the $k$-cut complex of the squared path $P_n^2$ is shellable for $n\\ge k+3$ and conjectured a finite-difference recurrence for its top reduced Betti number along every diagonal $n-k=r$. We prove the recurrence by giving the exact formula $\\beta(k,n)=\\binom{n-1}{k-1}-\\sum_{j=0}^{\\min\\{k-1,n-k\\}}\\binom{k-1}{j}(n-k-j+1)+(n-k)$ for $r=n-k\\ge3$. Equivalently, for fixed ","authors_text":"Yaoran Yang, Yutong Zhang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-21T17:57:09Z","title":"Betti Numbers of Cut Complexes of Squared Paths and a Recurrence Conjecture"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.22808","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:a89af791b2a164b37412b7e994e6ab93d98f2fdb2a7f5320043226a656888549","target":"record","created_at":"2026-05-22T02:04:55Z","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":"489f85e9ffc460ecce82df27a05a998f8ed76ae4f461dce9da4e8845adb92aa8","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-21T17:57:09Z","title_canon_sha256":"a1f157178fa2c6e0c10732b51fb036c83ba3b10e5bbf19a9ea1463f65c9585a4"},"schema_version":"1.0","source":{"id":"2605.22808","kind":"arxiv","version":1}},"canonical_sha256":"50b9131cf7323c60d3e1ef56fa216d8c9a0d17503c4bd57a72680b44d71d9214","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"50b9131cf7323c60d3e1ef56fa216d8c9a0d17503c4bd57a72680b44d71d9214","first_computed_at":"2026-05-22T02:04:55.708101Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-22T02:04:55.708101Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SF6QIllC1EebFecv8+1yE3dj2C5on21DwRYjN9zTLBulPY3Sj5kjd61UMif/3gc/7ZUEonkLXCKqTyHGG1u9Bg==","signature_status":"signed_v1","signed_at":"2026-05-22T02:04:55.708589Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.22808","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a89af791b2a164b37412b7e994e6ab93d98f2fdb2a7f5320043226a656888549","sha256:27c7106aada09b987faf5275ea4c85cbd51c28dabf17e7e60d3cd9e90c485887"],"state_sha256":"00e3310485b04e9920331a743f67ab0ab4f287779bdfa0055c28cf1d66f46a7d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qLaffxhT/6TxLdLEjUwPC0xbbgjGmRK8WTHpS+dcH/xBLlc3v2zQwalMgQUpV4DakjtHxLTwWC5ocaF+6Tu9Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T20:45:59.630358Z","bundle_sha256":"8a3beac3eeef26e41e90347be5f5cc2ee4433ffad6a7c5577ab464e17c3b6462"}}