{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:C6PTL3L3TFEDSWGBWH5QGWNBQP","short_pith_number":"pith:C6PTL3L3","canonical_record":{"source":{"id":"1401.0169","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-12-31T16:23:21Z","cross_cats_sorted":[],"title_canon_sha256":"8cb446506ca88167ddab15d92b84b416d048e40f9f51cbd49766b2f71318af49","abstract_canon_sha256":"aabdd53204f096802d71860fd511eefe90ebe258eb8b4425a1781cdde3f7e334"},"schema_version":"1.0"},"canonical_sha256":"179f35ed7b99483958c1b1fb0359a183ee1771fb5b81397f678eef87c4580cfa","source":{"kind":"arxiv","id":"1401.0169","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.0169","created_at":"2026-05-18T01:12:18Z"},{"alias_kind":"arxiv_version","alias_value":"1401.0169v3","created_at":"2026-05-18T01:12:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.0169","created_at":"2026-05-18T01:12:18Z"},{"alias_kind":"pith_short_12","alias_value":"C6PTL3L3TFED","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"C6PTL3L3TFEDSWGB","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"C6PTL3L3","created_at":"2026-05-18T12:27:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:C6PTL3L3TFEDSWGBWH5QGWNBQP","target":"record","payload":{"canonical_record":{"source":{"id":"1401.0169","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-12-31T16:23:21Z","cross_cats_sorted":[],"title_canon_sha256":"8cb446506ca88167ddab15d92b84b416d048e40f9f51cbd49766b2f71318af49","abstract_canon_sha256":"aabdd53204f096802d71860fd511eefe90ebe258eb8b4425a1781cdde3f7e334"},"schema_version":"1.0"},"canonical_sha256":"179f35ed7b99483958c1b1fb0359a183ee1771fb5b81397f678eef87c4580cfa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:18.882399Z","signature_b64":"AFDy2zlAdp/YaIKroz/yn9AKN2CLThW4S2sV1qvHRp5NCMP82KyFYow8WUjmGhiv/vpgAVk+ehyzzGJB8eDlDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"179f35ed7b99483958c1b1fb0359a183ee1771fb5b81397f678eef87c4580cfa","last_reissued_at":"2026-05-18T01:12:18.882017Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:18.882017Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.0169","source_version":3,"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-18T01:12:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"40lNBTsmjx3pPP4p4sFnOO5J5kZ+t1qMtrh7Ks6MLc1arxol9ZPVr7UsA9N20wHIDD5viEsCC89PViJMLK14AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T22:05:06.339759Z"},"content_sha256":"9f894077e8552e0601802cf9e108fade191953f0a63099d2e3db0a31e971e5ee","schema_version":"1.0","event_id":"sha256:9f894077e8552e0601802cf9e108fade191953f0a63099d2e3db0a31e971e5ee"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:C6PTL3L3TFEDSWGBWH5QGWNBQP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Extremal Hypergraphs for Ryser's Conjecture: Connectedness of Line Graphs of Bipartite Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Lothar Narins, Penny Haxell, Tibor Szab\\'o","submitted_at":"2013-12-31T16:23:21Z","abstract_excerpt":"In this paper we consider a natural extremal graph theoretic problem of topological sort, concerning the minimization of the (topological) connectedness of the independence complex of graphs in terms of its dimension. We observe that the lower bound $\\frac{\\dim(\\mathcal{I}(G))}{2} - 2$ on the connectedness of the independence complex $\\mathcal{I}(G)$ of line graphs of bipartite graphs $G$ is tight. In our main theorem we characterize the extremal examples. Our proof of this characterization is based on topological machinery.\n  Our motivation for studying this problem comes from a classical con"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.0169","kind":"arxiv","version":3},"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-18T01:12:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GrLtWxYSHe4cPzsB7l9LtqS8NLZx455uLvOI/ita9IXvBX9CHfF+OT1PEp3XBHU9jsMrRn10Btp/hJcznHk+AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T22:05:06.340126Z"},"content_sha256":"9bfb55f97d267630fef5acac883293b6ca739227f4ee979a6ad25e3b4231bc65","schema_version":"1.0","event_id":"sha256:9bfb55f97d267630fef5acac883293b6ca739227f4ee979a6ad25e3b4231bc65"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C6PTL3L3TFEDSWGBWH5QGWNBQP/bundle.json","state_url":"https://pith.science/pith/C6PTL3L3TFEDSWGBWH5QGWNBQP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C6PTL3L3TFEDSWGBWH5QGWNBQP/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-05-20T22:05:06Z","links":{"resolver":"https://pith.science/pith/C6PTL3L3TFEDSWGBWH5QGWNBQP","bundle":"https://pith.science/pith/C6PTL3L3TFEDSWGBWH5QGWNBQP/bundle.json","state":"https://pith.science/pith/C6PTL3L3TFEDSWGBWH5QGWNBQP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C6PTL3L3TFEDSWGBWH5QGWNBQP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:C6PTL3L3TFEDSWGBWH5QGWNBQP","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":"aabdd53204f096802d71860fd511eefe90ebe258eb8b4425a1781cdde3f7e334","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-12-31T16:23:21Z","title_canon_sha256":"8cb446506ca88167ddab15d92b84b416d048e40f9f51cbd49766b2f71318af49"},"schema_version":"1.0","source":{"id":"1401.0169","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.0169","created_at":"2026-05-18T01:12:18Z"},{"alias_kind":"arxiv_version","alias_value":"1401.0169v3","created_at":"2026-05-18T01:12:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.0169","created_at":"2026-05-18T01:12:18Z"},{"alias_kind":"pith_short_12","alias_value":"C6PTL3L3TFED","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"C6PTL3L3TFEDSWGB","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"C6PTL3L3","created_at":"2026-05-18T12:27:40Z"}],"graph_snapshots":[{"event_id":"sha256:9bfb55f97d267630fef5acac883293b6ca739227f4ee979a6ad25e3b4231bc65","target":"graph","created_at":"2026-05-18T01:12:18Z","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":"In this paper we consider a natural extremal graph theoretic problem of topological sort, concerning the minimization of the (topological) connectedness of the independence complex of graphs in terms of its dimension. We observe that the lower bound $\\frac{\\dim(\\mathcal{I}(G))}{2} - 2$ on the connectedness of the independence complex $\\mathcal{I}(G)$ of line graphs of bipartite graphs $G$ is tight. In our main theorem we characterize the extremal examples. Our proof of this characterization is based on topological machinery.\n  Our motivation for studying this problem comes from a classical con","authors_text":"Lothar Narins, Penny Haxell, Tibor Szab\\'o","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-12-31T16:23:21Z","title":"Extremal Hypergraphs for Ryser's Conjecture: Connectedness of Line Graphs of Bipartite Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.0169","kind":"arxiv","version":3},"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:9f894077e8552e0601802cf9e108fade191953f0a63099d2e3db0a31e971e5ee","target":"record","created_at":"2026-05-18T01:12:18Z","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":"aabdd53204f096802d71860fd511eefe90ebe258eb8b4425a1781cdde3f7e334","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-12-31T16:23:21Z","title_canon_sha256":"8cb446506ca88167ddab15d92b84b416d048e40f9f51cbd49766b2f71318af49"},"schema_version":"1.0","source":{"id":"1401.0169","kind":"arxiv","version":3}},"canonical_sha256":"179f35ed7b99483958c1b1fb0359a183ee1771fb5b81397f678eef87c4580cfa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"179f35ed7b99483958c1b1fb0359a183ee1771fb5b81397f678eef87c4580cfa","first_computed_at":"2026-05-18T01:12:18.882017Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:12:18.882017Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AFDy2zlAdp/YaIKroz/yn9AKN2CLThW4S2sV1qvHRp5NCMP82KyFYow8WUjmGhiv/vpgAVk+ehyzzGJB8eDlDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:12:18.882399Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.0169","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9f894077e8552e0601802cf9e108fade191953f0a63099d2e3db0a31e971e5ee","sha256:9bfb55f97d267630fef5acac883293b6ca739227f4ee979a6ad25e3b4231bc65"],"state_sha256":"5aad68e434cb06ff0565c16fd65214e0c238146772d1521f3b146ef0f06e0ef8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ftflSf+4bf/zQdUYwNgNuI1lvuvMnfmN6RHmT7zXsVwHqHn2YXBrkHAFUsGL7AQWUC1L4l3+V2xGYNmiDLIXCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T22:05:06.343277Z","bundle_sha256":"a2e4efc382ec254c0baa24635afb8c272092c7e2a1ce965549a708512fa701af"}}