{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:PHF6S7SSP2AYMIX2G6H22CTKZJ","short_pith_number":"pith:PHF6S7SS","schema_version":"1.0","canonical_sha256":"79cbe97e527e818622fa378fad0a6aca477779596186f26b9aa014b1e8188b25","source":{"kind":"arxiv","id":"2311.06407","version":1},"attestation_state":"computed","paper":{"title":"On the Connectivity of the Vietoris-Rips Complex of a Hypercube Graph","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["math.AT"],"primary_cat":"math.CO","authors_text":"Jelena Grbic, Martin Bendersky","submitted_at":"2023-11-10T21:54:12Z","abstract_excerpt":"We bring in the techniques of independence complexes and the notion of total dominating sets of a graph to bear on the question of the connectivity of the Vietoris-Rips complexes $VR(Q_n; r)$ of an $n$-hypercube graph. We obtain a lower bound for the connectivity of $VR(Q_n; r)$ for an arbitrary $n$-dimension hypercube and at all scale parameters $r$. The obtained bounds disprove the conjecture of Shukla that $\\VR$ is $r$-connected."},"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":"2311.06407","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.CO","submitted_at":"2023-11-10T21:54:12Z","cross_cats_sorted":["math.AT"],"title_canon_sha256":"16d59cc2363574581868d4fb371cd34ef7ca5f55783f54f46467c542e8db1a01","abstract_canon_sha256":"7dc949e96f36ced4ed6be7bef315aedc59cb321c24ebdaaaa8e6546339b6563e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:11:39.578454Z","signature_b64":"fWnp9CKalNnikQKUSrps1I7D075O6rnQiAnHzp3SlHbYCdPGpb6GoOttfqWa5Ttc+hTJ9rDVkTvch0nhvydXBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"79cbe97e527e818622fa378fad0a6aca477779596186f26b9aa014b1e8188b25","last_reissued_at":"2026-07-05T07:11:39.577987Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:11:39.577987Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Connectivity of the Vietoris-Rips Complex of a Hypercube Graph","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["math.AT"],"primary_cat":"math.CO","authors_text":"Jelena Grbic, Martin Bendersky","submitted_at":"2023-11-10T21:54:12Z","abstract_excerpt":"We bring in the techniques of independence complexes and the notion of total dominating sets of a graph to bear on the question of the connectivity of the Vietoris-Rips complexes $VR(Q_n; r)$ of an $n$-hypercube graph. We obtain a lower bound for the connectivity of $VR(Q_n; r)$ for an arbitrary $n$-dimension hypercube and at all scale parameters $r$. The obtained bounds disprove the conjecture of Shukla that $\\VR$ is $r$-connected."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.06407","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/2311.06407/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2311.06407","created_at":"2026-07-05T07:11:39.578051+00:00"},{"alias_kind":"arxiv_version","alias_value":"2311.06407v1","created_at":"2026-07-05T07:11:39.578051+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.06407","created_at":"2026-07-05T07:11:39.578051+00:00"},{"alias_kind":"pith_short_12","alias_value":"PHF6S7SSP2AY","created_at":"2026-07-05T07:11:39.578051+00:00"},{"alias_kind":"pith_short_16","alias_value":"PHF6S7SSP2AYMIX2","created_at":"2026-07-05T07:11:39.578051+00:00"},{"alias_kind":"pith_short_8","alias_value":"PHF6S7SS","created_at":"2026-07-05T07:11:39.578051+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2502.00122","citing_title":"Homotopy connectivity of \\v{C}ech complexes of spheres","ref_index":7,"is_internal_anchor":false},{"citing_arxiv_id":"2604.01510","citing_title":"A $\\mathbb{Z}_2$-Topological Framework for Sign-rank Lower Bounds","ref_index":2,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PHF6S7SSP2AYMIX2G6H22CTKZJ","json":"https://pith.science/pith/PHF6S7SSP2AYMIX2G6H22CTKZJ.json","graph_json":"https://pith.science/api/pith-number/PHF6S7SSP2AYMIX2G6H22CTKZJ/graph.json","events_json":"https://pith.science/api/pith-number/PHF6S7SSP2AYMIX2G6H22CTKZJ/events.json","paper":"https://pith.science/paper/PHF6S7SS"},"agent_actions":{"view_html":"https://pith.science/pith/PHF6S7SSP2AYMIX2G6H22CTKZJ","download_json":"https://pith.science/pith/PHF6S7SSP2AYMIX2G6H22CTKZJ.json","view_paper":"https://pith.science/paper/PHF6S7SS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2311.06407&json=true","fetch_graph":"https://pith.science/api/pith-number/PHF6S7SSP2AYMIX2G6H22CTKZJ/graph.json","fetch_events":"https://pith.science/api/pith-number/PHF6S7SSP2AYMIX2G6H22CTKZJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PHF6S7SSP2AYMIX2G6H22CTKZJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PHF6S7SSP2AYMIX2G6H22CTKZJ/action/storage_attestation","attest_author":"https://pith.science/pith/PHF6S7SSP2AYMIX2G6H22CTKZJ/action/author_attestation","sign_citation":"https://pith.science/pith/PHF6S7SSP2AYMIX2G6H22CTKZJ/action/citation_signature","submit_replication":"https://pith.science/pith/PHF6S7SSP2AYMIX2G6H22CTKZJ/action/replication_record"}},"created_at":"2026-07-05T07:11:39.578051+00:00","updated_at":"2026-07-05T07:11:39.578051+00:00"}