{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:UG34F33CE7HKAUZFXEOAJAJMPB","short_pith_number":"pith:UG34F33C","schema_version":"1.0","canonical_sha256":"a1b7c2ef6227cea05325b91c04812c78755076c70e13cc161c3b290afc85db3f","source":{"kind":"arxiv","id":"1502.02232","version":1},"attestation_state":"computed","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."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1502.02232","created_at":"2026-05-18T02:27:43.218508+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.02232v1","created_at":"2026-05-18T02:27:43.218508+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.02232","created_at":"2026-05-18T02:27:43.218508+00:00"},{"alias_kind":"pith_short_12","alias_value":"UG34F33CE7HK","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_16","alias_value":"UG34F33CE7HKAUZF","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_8","alias_value":"UG34F33C","created_at":"2026-05-18T12:29:44.643036+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UG34F33CE7HKAUZFXEOAJAJMPB","json":"https://pith.science/pith/UG34F33CE7HKAUZFXEOAJAJMPB.json","graph_json":"https://pith.science/api/pith-number/UG34F33CE7HKAUZFXEOAJAJMPB/graph.json","events_json":"https://pith.science/api/pith-number/UG34F33CE7HKAUZFXEOAJAJMPB/events.json","paper":"https://pith.science/paper/UG34F33C"},"agent_actions":{"view_html":"https://pith.science/pith/UG34F33CE7HKAUZFXEOAJAJMPB","download_json":"https://pith.science/pith/UG34F33CE7HKAUZFXEOAJAJMPB.json","view_paper":"https://pith.science/paper/UG34F33C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.02232&json=true","fetch_graph":"https://pith.science/api/pith-number/UG34F33CE7HKAUZFXEOAJAJMPB/graph.json","fetch_events":"https://pith.science/api/pith-number/UG34F33CE7HKAUZFXEOAJAJMPB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UG34F33CE7HKAUZFXEOAJAJMPB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UG34F33CE7HKAUZFXEOAJAJMPB/action/storage_attestation","attest_author":"https://pith.science/pith/UG34F33CE7HKAUZFXEOAJAJMPB/action/author_attestation","sign_citation":"https://pith.science/pith/UG34F33CE7HKAUZFXEOAJAJMPB/action/citation_signature","submit_replication":"https://pith.science/pith/UG34F33CE7HKAUZFXEOAJAJMPB/action/replication_record"}},"created_at":"2026-05-18T02:27:43.218508+00:00","updated_at":"2026-05-18T02:27:43.218508+00:00"}