{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:4NUN2VB6TRTC62LKVMRWNGK23E","short_pith_number":"pith:4NUN2VB6","schema_version":"1.0","canonical_sha256":"e368dd543e9c662f696aab2366995ad92ebbfdeaa95181d1a920280dbaa5569b","source":{"kind":"arxiv","id":"1212.4086","version":1},"attestation_state":"computed","paper":{"title":"On Frank's conjecture on k-connected orientations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Olivier Durand de Gevigney","submitted_at":"2012-12-17T18:01:10Z","abstract_excerpt":"We disprove a conjecture of Frank stating that each weakly 2k-connected has a k-vertex-connected orientation. For k at least 3, we also prove that the problem of deciding whether a graph has a k-vertex-connected orientation is NP-complete."},"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":"1212.4086","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-12-17T18:01:10Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"adeff90a14bf53a23f4488ac4ada9c85679f4de6cd39ac2b036622ed37ad76f0","abstract_canon_sha256":"814fba602787a2d4f651754d24a66b4666f475af15572a370bb9ff20b3cdfebf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:38:21.551253Z","signature_b64":"042J5DX5FJj03Dtk7JPB/WucgLYYIMbUM2eojn0yTXNF5SEJY8Y5UkucSySuRNg4BndORb8OOGlf/Jda1R76AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e368dd543e9c662f696aab2366995ad92ebbfdeaa95181d1a920280dbaa5569b","last_reissued_at":"2026-05-18T03:38:21.550336Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:38:21.550336Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Frank's conjecture on k-connected orientations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Olivier Durand de Gevigney","submitted_at":"2012-12-17T18:01:10Z","abstract_excerpt":"We disprove a conjecture of Frank stating that each weakly 2k-connected has a k-vertex-connected orientation. For k at least 3, we also prove that the problem of deciding whether a graph has a k-vertex-connected orientation is NP-complete."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.4086","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1212.4086","created_at":"2026-05-18T03:38:21.550540+00:00"},{"alias_kind":"arxiv_version","alias_value":"1212.4086v1","created_at":"2026-05-18T03:38:21.550540+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.4086","created_at":"2026-05-18T03:38:21.550540+00:00"},{"alias_kind":"pith_short_12","alias_value":"4NUN2VB6TRTC","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_16","alias_value":"4NUN2VB6TRTC62LK","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_8","alias_value":"4NUN2VB6","created_at":"2026-05-18T12:26:53.410803+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/4NUN2VB6TRTC62LKVMRWNGK23E","json":"https://pith.science/pith/4NUN2VB6TRTC62LKVMRWNGK23E.json","graph_json":"https://pith.science/api/pith-number/4NUN2VB6TRTC62LKVMRWNGK23E/graph.json","events_json":"https://pith.science/api/pith-number/4NUN2VB6TRTC62LKVMRWNGK23E/events.json","paper":"https://pith.science/paper/4NUN2VB6"},"agent_actions":{"view_html":"https://pith.science/pith/4NUN2VB6TRTC62LKVMRWNGK23E","download_json":"https://pith.science/pith/4NUN2VB6TRTC62LKVMRWNGK23E.json","view_paper":"https://pith.science/paper/4NUN2VB6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1212.4086&json=true","fetch_graph":"https://pith.science/api/pith-number/4NUN2VB6TRTC62LKVMRWNGK23E/graph.json","fetch_events":"https://pith.science/api/pith-number/4NUN2VB6TRTC62LKVMRWNGK23E/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4NUN2VB6TRTC62LKVMRWNGK23E/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4NUN2VB6TRTC62LKVMRWNGK23E/action/storage_attestation","attest_author":"https://pith.science/pith/4NUN2VB6TRTC62LKVMRWNGK23E/action/author_attestation","sign_citation":"https://pith.science/pith/4NUN2VB6TRTC62LKVMRWNGK23E/action/citation_signature","submit_replication":"https://pith.science/pith/4NUN2VB6TRTC62LKVMRWNGK23E/action/replication_record"}},"created_at":"2026-05-18T03:38:21.550540+00:00","updated_at":"2026-05-18T03:38:21.550540+00:00"}