{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:FHXOZORI7PTXHVRHZQ3S7TGUPG","short_pith_number":"pith:FHXOZORI","schema_version":"1.0","canonical_sha256":"29eeecba28fbe773d627cc372fccd47991990afe30432e9b3040f46cf4f05d2f","source":{"kind":"arxiv","id":"1406.4786","version":3},"attestation_state":"computed","paper":{"title":"On the existence of a connected component of a graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Carl Mummert, Jeffry L. Hirst, Kirill Gura","submitted_at":"2014-06-18T16:43:29Z","abstract_excerpt":"We study the reverse mathematics and computability of countable graph theory, obtaining the following results. The principle that every countable graph has a connected component is equivalent to $\\mathsf{ACA}_0$ over $\\mathsf{RCA}_0$. The problem of decomposing a countable graph into connected components is strongly Weihrauch equivalent to the problem of finding a single component, and each is equivalent to its infinite parallelization. For graphs with finitely many connected components, the existence of a connected component is either provable in $\\mathsf{RCA}_0$ or is equivalent to induction"},"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":"1406.4786","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2014-06-18T16:43:29Z","cross_cats_sorted":[],"title_canon_sha256":"5e2d2dabe9a338b660f704816e5594a14b75b5513857edf5b54375dc6d6e8ba8","abstract_canon_sha256":"01df481c65d6433880b4769cb77e221a15e7caa23c9c600cb68ccbc1456dca90"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:34:45.698484Z","signature_b64":"PrzE+eEww3Jg2I2/N6MIwgnbCqbJFUJxXz72od2UYQV1+jWineWWz7Ekf0GYyFHG8GkdksFge6Zdx0DYW3pvDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"29eeecba28fbe773d627cc372fccd47991990afe30432e9b3040f46cf4f05d2f","last_reissued_at":"2026-05-18T01:34:45.697878Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:34:45.697878Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the existence of a connected component of a graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Carl Mummert, Jeffry L. Hirst, Kirill Gura","submitted_at":"2014-06-18T16:43:29Z","abstract_excerpt":"We study the reverse mathematics and computability of countable graph theory, obtaining the following results. The principle that every countable graph has a connected component is equivalent to $\\mathsf{ACA}_0$ over $\\mathsf{RCA}_0$. The problem of decomposing a countable graph into connected components is strongly Weihrauch equivalent to the problem of finding a single component, and each is equivalent to its infinite parallelization. For graphs with finitely many connected components, the existence of a connected component is either provable in $\\mathsf{RCA}_0$ or is equivalent to induction"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.4786","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":"1406.4786","created_at":"2026-05-18T01:34:45.697960+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.4786v3","created_at":"2026-05-18T01:34:45.697960+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.4786","created_at":"2026-05-18T01:34:45.697960+00:00"},{"alias_kind":"pith_short_12","alias_value":"FHXOZORI7PTX","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_16","alias_value":"FHXOZORI7PTXHVRH","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_8","alias_value":"FHXOZORI","created_at":"2026-05-18T12:28:28.263976+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/FHXOZORI7PTXHVRHZQ3S7TGUPG","json":"https://pith.science/pith/FHXOZORI7PTXHVRHZQ3S7TGUPG.json","graph_json":"https://pith.science/api/pith-number/FHXOZORI7PTXHVRHZQ3S7TGUPG/graph.json","events_json":"https://pith.science/api/pith-number/FHXOZORI7PTXHVRHZQ3S7TGUPG/events.json","paper":"https://pith.science/paper/FHXOZORI"},"agent_actions":{"view_html":"https://pith.science/pith/FHXOZORI7PTXHVRHZQ3S7TGUPG","download_json":"https://pith.science/pith/FHXOZORI7PTXHVRHZQ3S7TGUPG.json","view_paper":"https://pith.science/paper/FHXOZORI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.4786&json=true","fetch_graph":"https://pith.science/api/pith-number/FHXOZORI7PTXHVRHZQ3S7TGUPG/graph.json","fetch_events":"https://pith.science/api/pith-number/FHXOZORI7PTXHVRHZQ3S7TGUPG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FHXOZORI7PTXHVRHZQ3S7TGUPG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FHXOZORI7PTXHVRHZQ3S7TGUPG/action/storage_attestation","attest_author":"https://pith.science/pith/FHXOZORI7PTXHVRHZQ3S7TGUPG/action/author_attestation","sign_citation":"https://pith.science/pith/FHXOZORI7PTXHVRHZQ3S7TGUPG/action/citation_signature","submit_replication":"https://pith.science/pith/FHXOZORI7PTXHVRHZQ3S7TGUPG/action/replication_record"}},"created_at":"2026-05-18T01:34:45.697960+00:00","updated_at":"2026-05-18T01:34:45.697960+00:00"}