{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:C6PTL3L3TFEDSWGBWH5QGWNBQP","short_pith_number":"pith:C6PTL3L3","schema_version":"1.0","canonical_sha256":"179f35ed7b99483958c1b1fb0359a183ee1771fb5b81397f678eef87c4580cfa","source":{"kind":"arxiv","id":"1401.0169","version":3},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1401.0169","created_at":"2026-05-18T01:12:18.882070+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.0169v3","created_at":"2026-05-18T01:12:18.882070+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.0169","created_at":"2026-05-18T01:12:18.882070+00:00"},{"alias_kind":"pith_short_12","alias_value":"C6PTL3L3TFED","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_16","alias_value":"C6PTL3L3TFEDSWGB","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_8","alias_value":"C6PTL3L3","created_at":"2026-05-18T12:27:40.988391+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/C6PTL3L3TFEDSWGBWH5QGWNBQP","json":"https://pith.science/pith/C6PTL3L3TFEDSWGBWH5QGWNBQP.json","graph_json":"https://pith.science/api/pith-number/C6PTL3L3TFEDSWGBWH5QGWNBQP/graph.json","events_json":"https://pith.science/api/pith-number/C6PTL3L3TFEDSWGBWH5QGWNBQP/events.json","paper":"https://pith.science/paper/C6PTL3L3"},"agent_actions":{"view_html":"https://pith.science/pith/C6PTL3L3TFEDSWGBWH5QGWNBQP","download_json":"https://pith.science/pith/C6PTL3L3TFEDSWGBWH5QGWNBQP.json","view_paper":"https://pith.science/paper/C6PTL3L3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.0169&json=true","fetch_graph":"https://pith.science/api/pith-number/C6PTL3L3TFEDSWGBWH5QGWNBQP/graph.json","fetch_events":"https://pith.science/api/pith-number/C6PTL3L3TFEDSWGBWH5QGWNBQP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C6PTL3L3TFEDSWGBWH5QGWNBQP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C6PTL3L3TFEDSWGBWH5QGWNBQP/action/storage_attestation","attest_author":"https://pith.science/pith/C6PTL3L3TFEDSWGBWH5QGWNBQP/action/author_attestation","sign_citation":"https://pith.science/pith/C6PTL3L3TFEDSWGBWH5QGWNBQP/action/citation_signature","submit_replication":"https://pith.science/pith/C6PTL3L3TFEDSWGBWH5QGWNBQP/action/replication_record"}},"created_at":"2026-05-18T01:12:18.882070+00:00","updated_at":"2026-05-18T01:12:18.882070+00:00"}