{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:PHF6S7SSP2AYMIX2G6H22CTKZJ","short_pith_number":"pith:PHF6S7SS","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"},"canonical_sha256":"79cbe97e527e818622fa378fad0a6aca477779596186f26b9aa014b1e8188b25","source":{"kind":"arxiv","id":"2311.06407","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2311.06407","created_at":"2026-07-05T07:11:39Z"},{"alias_kind":"arxiv_version","alias_value":"2311.06407v1","created_at":"2026-07-05T07:11:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.06407","created_at":"2026-07-05T07:11:39Z"},{"alias_kind":"pith_short_12","alias_value":"PHF6S7SSP2AY","created_at":"2026-07-05T07:11:39Z"},{"alias_kind":"pith_short_16","alias_value":"PHF6S7SSP2AYMIX2","created_at":"2026-07-05T07:11:39Z"},{"alias_kind":"pith_short_8","alias_value":"PHF6S7SS","created_at":"2026-07-05T07:11:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:PHF6S7SSP2AYMIX2G6H22CTKZJ","target":"record","payload":{"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"},"canonical_sha256":"79cbe97e527e818622fa378fad0a6aca477779596186f26b9aa014b1e8188b25","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"},"source_kind":"arxiv","source_id":"2311.06407","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-07-05T07:11:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YH9ybPJMUzw04zd4IhkgsuRpMMcSsGOxXEuVjPPTQdNHM7llqrcHHj5oQTJwsXCnvbpjDEJUquNDuTQEdfxkDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-22T05:43:44.271349Z"},"content_sha256":"44dcef8db22d699863f866b8ee6cafa2b00df1433c54aace7d35d8e8429498c8","schema_version":"1.0","event_id":"sha256:44dcef8db22d699863f866b8ee6cafa2b00df1433c54aace7d35d8e8429498c8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:PHF6S7SSP2AYMIX2G6H22CTKZJ","target":"graph","payload":{"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"},"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-07-05T07:11:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0Ue/hjaNj/aKXSUvG9nmhrnoFFIIomAH5FMDTACwAKbB+Q4ESzxuleeBIdJe4I6xAIAJpnVGPPRp8nklh/EwBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-22T05:43:44.271735Z"},"content_sha256":"7cb40ccaec44c60d53be6fca89040a46eac59ec13de0a9bf030b38fa00f86faf","schema_version":"1.0","event_id":"sha256:7cb40ccaec44c60d53be6fca89040a46eac59ec13de0a9bf030b38fa00f86faf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PHF6S7SSP2AYMIX2G6H22CTKZJ/bundle.json","state_url":"https://pith.science/pith/PHF6S7SSP2AYMIX2G6H22CTKZJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PHF6S7SSP2AYMIX2G6H22CTKZJ/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-22T05:43:44Z","links":{"resolver":"https://pith.science/pith/PHF6S7SSP2AYMIX2G6H22CTKZJ","bundle":"https://pith.science/pith/PHF6S7SSP2AYMIX2G6H22CTKZJ/bundle.json","state":"https://pith.science/pith/PHF6S7SSP2AYMIX2G6H22CTKZJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PHF6S7SSP2AYMIX2G6H22CTKZJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:PHF6S7SSP2AYMIX2G6H22CTKZJ","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":"7dc949e96f36ced4ed6be7bef315aedc59cb321c24ebdaaaa8e6546339b6563e","cross_cats_sorted":["math.AT"],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.CO","submitted_at":"2023-11-10T21:54:12Z","title_canon_sha256":"16d59cc2363574581868d4fb371cd34ef7ca5f55783f54f46467c542e8db1a01"},"schema_version":"1.0","source":{"id":"2311.06407","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2311.06407","created_at":"2026-07-05T07:11:39Z"},{"alias_kind":"arxiv_version","alias_value":"2311.06407v1","created_at":"2026-07-05T07:11:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.06407","created_at":"2026-07-05T07:11:39Z"},{"alias_kind":"pith_short_12","alias_value":"PHF6S7SSP2AY","created_at":"2026-07-05T07:11:39Z"},{"alias_kind":"pith_short_16","alias_value":"PHF6S7SSP2AYMIX2","created_at":"2026-07-05T07:11:39Z"},{"alias_kind":"pith_short_8","alias_value":"PHF6S7SS","created_at":"2026-07-05T07:11:39Z"}],"graph_snapshots":[{"event_id":"sha256:7cb40ccaec44c60d53be6fca89040a46eac59ec13de0a9bf030b38fa00f86faf","target":"graph","created_at":"2026-07-05T07:11:39Z","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/2311.06407/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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.","authors_text":"Jelena Grbic, Martin Bendersky","cross_cats":["math.AT"],"headline":"","license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.CO","submitted_at":"2023-11-10T21:54:12Z","title":"On the Connectivity of the Vietoris-Rips Complex of a Hypercube Graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.06407","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:44dcef8db22d699863f866b8ee6cafa2b00df1433c54aace7d35d8e8429498c8","target":"record","created_at":"2026-07-05T07:11:39Z","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":"7dc949e96f36ced4ed6be7bef315aedc59cb321c24ebdaaaa8e6546339b6563e","cross_cats_sorted":["math.AT"],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.CO","submitted_at":"2023-11-10T21:54:12Z","title_canon_sha256":"16d59cc2363574581868d4fb371cd34ef7ca5f55783f54f46467c542e8db1a01"},"schema_version":"1.0","source":{"id":"2311.06407","kind":"arxiv","version":1}},"canonical_sha256":"79cbe97e527e818622fa378fad0a6aca477779596186f26b9aa014b1e8188b25","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"79cbe97e527e818622fa378fad0a6aca477779596186f26b9aa014b1e8188b25","first_computed_at":"2026-07-05T07:11:39.577987Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:11:39.577987Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fWnp9CKalNnikQKUSrps1I7D075O6rnQiAnHzp3SlHbYCdPGpb6GoOttfqWa5Ttc+hTJ9rDVkTvch0nhvydXBA==","signature_status":"signed_v1","signed_at":"2026-07-05T07:11:39.578454Z","signed_message":"canonical_sha256_bytes"},"source_id":"2311.06407","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:44dcef8db22d699863f866b8ee6cafa2b00df1433c54aace7d35d8e8429498c8","sha256:7cb40ccaec44c60d53be6fca89040a46eac59ec13de0a9bf030b38fa00f86faf"],"state_sha256":"6e604f08a6d3bf5c82824c55899d2f5697c1d65a7f4951c6f1652369317e1fe2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WYXEW8K5jstMzr8WeM6IRslqHPR0YB9IH2VvrSGA3kc1kNNRx4kfERdpsW50nmmOK4IoZYpdbJPhsODX07jGAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-22T05:43:44.273928Z","bundle_sha256":"cf7c75634ad7c4eb1704e7c6cd03db698b9b2995374ca31d56b4ed414c157a36"}}