{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:UG34F33CE7HKAUZFXEOAJAJMPB","short_pith_number":"pith:UG34F33C","canonical_record":{"source":{"id":"1502.02232","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-02-08T10:20:21Z","cross_cats_sorted":[],"title_canon_sha256":"3ea4c75514249d4689c1a4079c3f7815268ef21179d5bcbde6ee2013b47ce957","abstract_canon_sha256":"cace12e076dc5f30989ad7ec958c63c8987f4902cf74ebb505ec9f6bb14a7baa"},"schema_version":"1.0"},"canonical_sha256":"a1b7c2ef6227cea05325b91c04812c78755076c70e13cc161c3b290afc85db3f","source":{"kind":"arxiv","id":"1502.02232","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.02232","created_at":"2026-05-18T02:27:43Z"},{"alias_kind":"arxiv_version","alias_value":"1502.02232v1","created_at":"2026-05-18T02:27:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.02232","created_at":"2026-05-18T02:27:43Z"},{"alias_kind":"pith_short_12","alias_value":"UG34F33CE7HK","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"UG34F33CE7HKAUZF","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"UG34F33C","created_at":"2026-05-18T12:29:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:UG34F33CE7HKAUZFXEOAJAJMPB","target":"record","payload":{"canonical_record":{"source":{"id":"1502.02232","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-02-08T10:20:21Z","cross_cats_sorted":[],"title_canon_sha256":"3ea4c75514249d4689c1a4079c3f7815268ef21179d5bcbde6ee2013b47ce957","abstract_canon_sha256":"cace12e076dc5f30989ad7ec958c63c8987f4902cf74ebb505ec9f6bb14a7baa"},"schema_version":"1.0"},"canonical_sha256":"a1b7c2ef6227cea05325b91c04812c78755076c70e13cc161c3b290afc85db3f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:27:43.219153Z","signature_b64":"gqVIK3vl0vkjqP3ckt5ppny1ku72L3FU3NismiPRsgwFF/NaL0lmJsvIF2+SPqdStCQr1JKwu6c9uDn4l7WFBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a1b7c2ef6227cea05325b91c04812c78755076c70e13cc161c3b290afc85db3f","last_reissued_at":"2026-05-18T02:27:43.218156Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:27:43.218156Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1502.02232","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-18T02:27:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W2h8hj1rR1fTBuOmDmuH+VFLlVXDlNsVHhPHrZ0uKtQZgh6QPlFqN5amS/FwNLSqAkOoeD1+zCmOMTyBpQ6yBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T16:57:06.667844Z"},"content_sha256":"a982c2d94cb52ed8eb752677eed311a574f11a547ae1ab2ad4aeab0e5504d016","schema_version":"1.0","event_id":"sha256:a982c2d94cb52ed8eb752677eed311a574f11a547ae1ab2ad4aeab0e5504d016"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:UG34F33CE7HKAUZFXEOAJAJMPB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Connectivity of the Facet Graphs of Simplicial Complexes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ilan I. Newman, Yuri Rabinovich","submitted_at":"2015-02-08T10:20:21Z","abstract_excerpt":"The paper studies the connectivity properties of facet graphs of simplicial complexes of combinatorial interest. In particular, it is shown that the facet graphs of $d$-cycles, $d$-hypertrees and $d$-hypercuts are, respectively, $(d+1)$, $d$, and $(n-d-1)$-vertex-connected. It is also shown that the facet graph of a $d$-cycle cannot be split into more than $s$ connected components by removing at most $s$ vertices. In addition, the paper discusses various related issues, as well as an extension to cell-complexes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.02232","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":""},"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-18T02:27:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fUUfM6Nydc5ko+HkSkhUWLbsNEhYDIDChxYueg5kZl0728BTR2KVl1VJFOfqVztcoJGnZhOk6krVkpMwkVJrDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T16:57:06.668188Z"},"content_sha256":"16d7295f7dbe56356921375674a50cb086ac51a4f5573c7a95997d4b4495768e","schema_version":"1.0","event_id":"sha256:16d7295f7dbe56356921375674a50cb086ac51a4f5573c7a95997d4b4495768e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UG34F33CE7HKAUZFXEOAJAJMPB/bundle.json","state_url":"https://pith.science/pith/UG34F33CE7HKAUZFXEOAJAJMPB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UG34F33CE7HKAUZFXEOAJAJMPB/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-01T16:57:06Z","links":{"resolver":"https://pith.science/pith/UG34F33CE7HKAUZFXEOAJAJMPB","bundle":"https://pith.science/pith/UG34F33CE7HKAUZFXEOAJAJMPB/bundle.json","state":"https://pith.science/pith/UG34F33CE7HKAUZFXEOAJAJMPB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UG34F33CE7HKAUZFXEOAJAJMPB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:UG34F33CE7HKAUZFXEOAJAJMPB","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":"cace12e076dc5f30989ad7ec958c63c8987f4902cf74ebb505ec9f6bb14a7baa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-02-08T10:20:21Z","title_canon_sha256":"3ea4c75514249d4689c1a4079c3f7815268ef21179d5bcbde6ee2013b47ce957"},"schema_version":"1.0","source":{"id":"1502.02232","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.02232","created_at":"2026-05-18T02:27:43Z"},{"alias_kind":"arxiv_version","alias_value":"1502.02232v1","created_at":"2026-05-18T02:27:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.02232","created_at":"2026-05-18T02:27:43Z"},{"alias_kind":"pith_short_12","alias_value":"UG34F33CE7HK","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"UG34F33CE7HKAUZF","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"UG34F33C","created_at":"2026-05-18T12:29:44Z"}],"graph_snapshots":[{"event_id":"sha256:16d7295f7dbe56356921375674a50cb086ac51a4f5573c7a95997d4b4495768e","target":"graph","created_at":"2026-05-18T02:27:43Z","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"},"paper":{"abstract_excerpt":"The paper studies the connectivity properties of facet graphs of simplicial complexes of combinatorial interest. In particular, it is shown that the facet graphs of $d$-cycles, $d$-hypertrees and $d$-hypercuts are, respectively, $(d+1)$, $d$, and $(n-d-1)$-vertex-connected. It is also shown that the facet graph of a $d$-cycle cannot be split into more than $s$ connected components by removing at most $s$ vertices. In addition, the paper discusses various related issues, as well as an extension to cell-complexes.","authors_text":"Ilan I. Newman, Yuri Rabinovich","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-02-08T10:20:21Z","title":"On Connectivity of the Facet Graphs of Simplicial Complexes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.02232","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:a982c2d94cb52ed8eb752677eed311a574f11a547ae1ab2ad4aeab0e5504d016","target":"record","created_at":"2026-05-18T02:27:43Z","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":"cace12e076dc5f30989ad7ec958c63c8987f4902cf74ebb505ec9f6bb14a7baa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-02-08T10:20:21Z","title_canon_sha256":"3ea4c75514249d4689c1a4079c3f7815268ef21179d5bcbde6ee2013b47ce957"},"schema_version":"1.0","source":{"id":"1502.02232","kind":"arxiv","version":1}},"canonical_sha256":"a1b7c2ef6227cea05325b91c04812c78755076c70e13cc161c3b290afc85db3f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a1b7c2ef6227cea05325b91c04812c78755076c70e13cc161c3b290afc85db3f","first_computed_at":"2026-05-18T02:27:43.218156Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:27:43.218156Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gqVIK3vl0vkjqP3ckt5ppny1ku72L3FU3NismiPRsgwFF/NaL0lmJsvIF2+SPqdStCQr1JKwu6c9uDn4l7WFBg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:27:43.219153Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.02232","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a982c2d94cb52ed8eb752677eed311a574f11a547ae1ab2ad4aeab0e5504d016","sha256:16d7295f7dbe56356921375674a50cb086ac51a4f5573c7a95997d4b4495768e"],"state_sha256":"35461c55f39dd54fb10e543175c8ff48ac1b93b87505c46f012769fcd2b58426"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6oZEu/E2rf/Nj10mqDUn5YJvQinSWkFQ9EHfDW82PjQde4WkrZAHX2WQoSyYDh8ANMS0k4IppPuOtL3fnTXeAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T16:57:06.670072Z","bundle_sha256":"e700eb9b7f3be077dbd9fa73797444fec2fe419905b9226fc77101213df7c32b"}}