{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:OM7L4TCZR2BSNPD6ML77VITRNM","short_pith_number":"pith:OM7L4TCZ","schema_version":"1.0","canonical_sha256":"733ebe4c598e8326bc7e62fffaa2716b21d73f9b6492b380670a034883155db6","source":{"kind":"arxiv","id":"1410.4902","version":3},"attestation_state":"computed","paper":{"title":"On a Conjecture of Thomassen","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Asaf Ferber, Michelle Delcourt","submitted_at":"2014-10-18T03:24:45Z","abstract_excerpt":"In 1989, Thomassen asked whether there is an integer-valued function f(k) such that every f(k)-connected graph admits a spanning, bipartite $k$-connected subgraph. In this paper we take a first, humble approach, showing the conjecture is true up to a log n factor."},"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":"1410.4902","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-10-18T03:24:45Z","cross_cats_sorted":[],"title_canon_sha256":"b5d7df2c984c01c0936a9d72adab67b6ae0d246e9659a683cc239e7e11110856","abstract_canon_sha256":"1d217e0aea21ab202ad029ea87a803141115bc4d07ed14f6c750a0c779ad4164"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:55:33.441632Z","signature_b64":"HrUrGzgaeHJ/Xkv+Yzxop+T28D4U5LdGqCrGtTuVAR3hNf1xOU7sp+ypa5MI/JCv7JjB7rXjAzAzuJphlGjWDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"733ebe4c598e8326bc7e62fffaa2716b21d73f9b6492b380670a034883155db6","last_reissued_at":"2026-05-18T01:55:33.441040Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:55:33.441040Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On a Conjecture of Thomassen","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Asaf Ferber, Michelle Delcourt","submitted_at":"2014-10-18T03:24:45Z","abstract_excerpt":"In 1989, Thomassen asked whether there is an integer-valued function f(k) such that every f(k)-connected graph admits a spanning, bipartite $k$-connected subgraph. In this paper we take a first, humble approach, showing the conjecture is true up to a log n factor."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.4902","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":"1410.4902","created_at":"2026-05-18T01:55:33.441118+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.4902v3","created_at":"2026-05-18T01:55:33.441118+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.4902","created_at":"2026-05-18T01:55:33.441118+00:00"},{"alias_kind":"pith_short_12","alias_value":"OM7L4TCZR2BS","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_16","alias_value":"OM7L4TCZR2BSNPD6","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_8","alias_value":"OM7L4TCZ","created_at":"2026-05-18T12:28:41.024544+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/OM7L4TCZR2BSNPD6ML77VITRNM","json":"https://pith.science/pith/OM7L4TCZR2BSNPD6ML77VITRNM.json","graph_json":"https://pith.science/api/pith-number/OM7L4TCZR2BSNPD6ML77VITRNM/graph.json","events_json":"https://pith.science/api/pith-number/OM7L4TCZR2BSNPD6ML77VITRNM/events.json","paper":"https://pith.science/paper/OM7L4TCZ"},"agent_actions":{"view_html":"https://pith.science/pith/OM7L4TCZR2BSNPD6ML77VITRNM","download_json":"https://pith.science/pith/OM7L4TCZR2BSNPD6ML77VITRNM.json","view_paper":"https://pith.science/paper/OM7L4TCZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.4902&json=true","fetch_graph":"https://pith.science/api/pith-number/OM7L4TCZR2BSNPD6ML77VITRNM/graph.json","fetch_events":"https://pith.science/api/pith-number/OM7L4TCZR2BSNPD6ML77VITRNM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OM7L4TCZR2BSNPD6ML77VITRNM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OM7L4TCZR2BSNPD6ML77VITRNM/action/storage_attestation","attest_author":"https://pith.science/pith/OM7L4TCZR2BSNPD6ML77VITRNM/action/author_attestation","sign_citation":"https://pith.science/pith/OM7L4TCZR2BSNPD6ML77VITRNM/action/citation_signature","submit_replication":"https://pith.science/pith/OM7L4TCZR2BSNPD6ML77VITRNM/action/replication_record"}},"created_at":"2026-05-18T01:55:33.441118+00:00","updated_at":"2026-05-18T01:55:33.441118+00:00"}