{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:U5HSCKLOLYQ5QWHS3L7ULWQUPB","short_pith_number":"pith:U5HSCKLO","canonical_record":{"source":{"id":"1009.3900","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-09-20T17:50:38Z","cross_cats_sorted":["math.AT","math.LO"],"title_canon_sha256":"7abcf5f0f4a24369fe7562df8dda9dbb91717c8a6b045ba18b59f22f74e0967e","abstract_canon_sha256":"d00d55b12e11cea56a9e3cbaf17cd4368a8780b061bbd31e013defbf2e847351"},"schema_version":"1.0"},"canonical_sha256":"a74f21296e5e21d858f2daff45da14785848e4a7073be4d96ca58937de8c77b1","source":{"kind":"arxiv","id":"1009.3900","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.3900","created_at":"2026-05-18T04:40:43Z"},{"alias_kind":"arxiv_version","alias_value":"1009.3900v1","created_at":"2026-05-18T04:40:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.3900","created_at":"2026-05-18T04:40:43Z"},{"alias_kind":"pith_short_12","alias_value":"U5HSCKLOLYQ5","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"U5HSCKLOLYQ5QWHS","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"U5HSCKLO","created_at":"2026-05-18T12:26:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:U5HSCKLOLYQ5QWHS3L7ULWQUPB","target":"record","payload":{"canonical_record":{"source":{"id":"1009.3900","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-09-20T17:50:38Z","cross_cats_sorted":["math.AT","math.LO"],"title_canon_sha256":"7abcf5f0f4a24369fe7562df8dda9dbb91717c8a6b045ba18b59f22f74e0967e","abstract_canon_sha256":"d00d55b12e11cea56a9e3cbaf17cd4368a8780b061bbd31e013defbf2e847351"},"schema_version":"1.0"},"canonical_sha256":"a74f21296e5e21d858f2daff45da14785848e4a7073be4d96ca58937de8c77b1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:40:43.523498Z","signature_b64":"uDj3mTBbR5W6GsAehQhC9ljabYVbS7IHQpqU1zf+EgE2BphBSeNYdMtBlcIZ8TxamIVQtth7pcfSUQCqFvFEDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a74f21296e5e21d858f2daff45da14785848e4a7073be4d96ca58937de8c77b1","last_reissued_at":"2026-05-18T04:40:43.522789Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:40:43.522789Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1009.3900","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-18T04:40:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xy/SL5jgbDYuEGKOk6+68bKLCtX5BzJlEJ3BUaMZNlgMpwCK60MGRS1Y1hWNfhNle/8sXri6Vl9qZoMD5nXbAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T03:12:10.215367Z"},"content_sha256":"8f1c1bc17b576db143a9678e52a754de57678e01e7346c4360de2da3f0648c8c","schema_version":"1.0","event_id":"sha256:8f1c1bc17b576db143a9678e52a754de57678e01e7346c4360de2da3f0648c8c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:U5HSCKLOLYQ5QWHS3L7ULWQUPB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The word problem and the Aharoni-Berger-Ziv conjecture on the connectivity of independence complexes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AT","math.LO"],"primary_cat":"math.CO","authors_text":"Jonathan Ariel Barmak","submitted_at":"2010-09-20T17:50:38Z","abstract_excerpt":"For each finite simple graph $G$, Aharoni, Berger and Ziv consider a recursively defined number $\\psi (G) \\in \\mathbb{Z}\\cup \\{+ \\infty \\}$ which gives a lower bound for the topological connectivity of the independence complex $I_G$. They conjecture that this bound is optimal for every graph. We use a result of recursion theory to give a short disproof of this claim."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.3900","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-18T04:40:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lG6gst5iIbGtXlW+ELB4nQQAH6WJ/4I3q1DF2UuCZuZdRD0AgVFd1nsScSgvH5dY7f8tedpsEyc79ZQ6fkCoBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T03:12:10.215731Z"},"content_sha256":"632ce1151f54f5bf9a760f7144b716ca5c75cb388a329c01d00fffff0f22311a","schema_version":"1.0","event_id":"sha256:632ce1151f54f5bf9a760f7144b716ca5c75cb388a329c01d00fffff0f22311a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/U5HSCKLOLYQ5QWHS3L7ULWQUPB/bundle.json","state_url":"https://pith.science/pith/U5HSCKLOLYQ5QWHS3L7ULWQUPB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/U5HSCKLOLYQ5QWHS3L7ULWQUPB/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-04T03:12:10Z","links":{"resolver":"https://pith.science/pith/U5HSCKLOLYQ5QWHS3L7ULWQUPB","bundle":"https://pith.science/pith/U5HSCKLOLYQ5QWHS3L7ULWQUPB/bundle.json","state":"https://pith.science/pith/U5HSCKLOLYQ5QWHS3L7ULWQUPB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/U5HSCKLOLYQ5QWHS3L7ULWQUPB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:U5HSCKLOLYQ5QWHS3L7ULWQUPB","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":"d00d55b12e11cea56a9e3cbaf17cd4368a8780b061bbd31e013defbf2e847351","cross_cats_sorted":["math.AT","math.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-09-20T17:50:38Z","title_canon_sha256":"7abcf5f0f4a24369fe7562df8dda9dbb91717c8a6b045ba18b59f22f74e0967e"},"schema_version":"1.0","source":{"id":"1009.3900","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.3900","created_at":"2026-05-18T04:40:43Z"},{"alias_kind":"arxiv_version","alias_value":"1009.3900v1","created_at":"2026-05-18T04:40:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.3900","created_at":"2026-05-18T04:40:43Z"},{"alias_kind":"pith_short_12","alias_value":"U5HSCKLOLYQ5","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"U5HSCKLOLYQ5QWHS","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"U5HSCKLO","created_at":"2026-05-18T12:26:15Z"}],"graph_snapshots":[{"event_id":"sha256:632ce1151f54f5bf9a760f7144b716ca5c75cb388a329c01d00fffff0f22311a","target":"graph","created_at":"2026-05-18T04:40: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":"For each finite simple graph $G$, Aharoni, Berger and Ziv consider a recursively defined number $\\psi (G) \\in \\mathbb{Z}\\cup \\{+ \\infty \\}$ which gives a lower bound for the topological connectivity of the independence complex $I_G$. They conjecture that this bound is optimal for every graph. We use a result of recursion theory to give a short disproof of this claim.","authors_text":"Jonathan Ariel Barmak","cross_cats":["math.AT","math.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-09-20T17:50:38Z","title":"The word problem and the Aharoni-Berger-Ziv conjecture on the connectivity of independence complexes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.3900","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:8f1c1bc17b576db143a9678e52a754de57678e01e7346c4360de2da3f0648c8c","target":"record","created_at":"2026-05-18T04:40: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":"d00d55b12e11cea56a9e3cbaf17cd4368a8780b061bbd31e013defbf2e847351","cross_cats_sorted":["math.AT","math.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-09-20T17:50:38Z","title_canon_sha256":"7abcf5f0f4a24369fe7562df8dda9dbb91717c8a6b045ba18b59f22f74e0967e"},"schema_version":"1.0","source":{"id":"1009.3900","kind":"arxiv","version":1}},"canonical_sha256":"a74f21296e5e21d858f2daff45da14785848e4a7073be4d96ca58937de8c77b1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a74f21296e5e21d858f2daff45da14785848e4a7073be4d96ca58937de8c77b1","first_computed_at":"2026-05-18T04:40:43.522789Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:40:43.522789Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uDj3mTBbR5W6GsAehQhC9ljabYVbS7IHQpqU1zf+EgE2BphBSeNYdMtBlcIZ8TxamIVQtth7pcfSUQCqFvFEDA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:40:43.523498Z","signed_message":"canonical_sha256_bytes"},"source_id":"1009.3900","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8f1c1bc17b576db143a9678e52a754de57678e01e7346c4360de2da3f0648c8c","sha256:632ce1151f54f5bf9a760f7144b716ca5c75cb388a329c01d00fffff0f22311a"],"state_sha256":"6c475ef163ac3df8ade8f4bbb92837f022fc5345afa9795ef7f5e562d460827d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w7rtBg/7oh/Y5WS+0oe1BVrb1dQDdSd7XEvatH6XvADzQ4JWg4QTB3iIOx5diRRPCUPLcSW5RBAIMzFkNY/6Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-04T03:12:10.218011Z","bundle_sha256":"9d0b23ff7452826aa711ef934b24af47929631fb6b34c65fb148f61340c998c8"}}