{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:ZFWKTEQ2PGSC5MKC7GXE52GZOZ","short_pith_number":"pith:ZFWKTEQ2","schema_version":"1.0","canonical_sha256":"c96ca9921a79a42eb142f9ae4ee8d976519c6077c4618d0e34fc00213d1cfbca","source":{"kind":"arxiv","id":"1512.05675","version":1},"attestation_state":"computed","paper":{"title":"3-connected graphs and their degree sequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jonathan McLaughlin","submitted_at":"2015-12-17T17:19:59Z","abstract_excerpt":"Necessary and sufficient conditions for a sequence of positive integers to be the degree sequence of a 3-connected simple graph are detailed. Conditions are also given under which such a sequence is necessarily 3-connected i.e. the sequence can only be realised as a 3-connected graph. Finally, a matrix is introduced whose non-empty entries partition the set of 3-connected graphs."},"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":"1512.05675","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-12-17T17:19:59Z","cross_cats_sorted":[],"title_canon_sha256":"783bf489e81a6d94b8be3e855a20975dd2bcfb800af8dd9b193c74e4f67ac6c4","abstract_canon_sha256":"f8c6cde5be9538eb473e94ff042d98696da1b5e6f7c18e1c504e30121ddfa348"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:24:09.516812Z","signature_b64":"m75j1THFoDQ3dI6OxZfX3F3ZPwdDy6ilJQLr08+o72v97kwWNDiefUe5TVg296U6s2JKu39yGewdQ/gQOGHtBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c96ca9921a79a42eb142f9ae4ee8d976519c6077c4618d0e34fc00213d1cfbca","last_reissued_at":"2026-05-18T01:24:09.516268Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:24:09.516268Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"3-connected graphs and their degree sequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jonathan McLaughlin","submitted_at":"2015-12-17T17:19:59Z","abstract_excerpt":"Necessary and sufficient conditions for a sequence of positive integers to be the degree sequence of a 3-connected simple graph are detailed. Conditions are also given under which such a sequence is necessarily 3-connected i.e. the sequence can only be realised as a 3-connected graph. Finally, a matrix is introduced whose non-empty entries partition the set of 3-connected graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.05675","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":"1512.05675","created_at":"2026-05-18T01:24:09.516374+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.05675v1","created_at":"2026-05-18T01:24:09.516374+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.05675","created_at":"2026-05-18T01:24:09.516374+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZFWKTEQ2PGSC","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZFWKTEQ2PGSC5MKC","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZFWKTEQ2","created_at":"2026-05-18T12:29:52.810259+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/ZFWKTEQ2PGSC5MKC7GXE52GZOZ","json":"https://pith.science/pith/ZFWKTEQ2PGSC5MKC7GXE52GZOZ.json","graph_json":"https://pith.science/api/pith-number/ZFWKTEQ2PGSC5MKC7GXE52GZOZ/graph.json","events_json":"https://pith.science/api/pith-number/ZFWKTEQ2PGSC5MKC7GXE52GZOZ/events.json","paper":"https://pith.science/paper/ZFWKTEQ2"},"agent_actions":{"view_html":"https://pith.science/pith/ZFWKTEQ2PGSC5MKC7GXE52GZOZ","download_json":"https://pith.science/pith/ZFWKTEQ2PGSC5MKC7GXE52GZOZ.json","view_paper":"https://pith.science/paper/ZFWKTEQ2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.05675&json=true","fetch_graph":"https://pith.science/api/pith-number/ZFWKTEQ2PGSC5MKC7GXE52GZOZ/graph.json","fetch_events":"https://pith.science/api/pith-number/ZFWKTEQ2PGSC5MKC7GXE52GZOZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZFWKTEQ2PGSC5MKC7GXE52GZOZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZFWKTEQ2PGSC5MKC7GXE52GZOZ/action/storage_attestation","attest_author":"https://pith.science/pith/ZFWKTEQ2PGSC5MKC7GXE52GZOZ/action/author_attestation","sign_citation":"https://pith.science/pith/ZFWKTEQ2PGSC5MKC7GXE52GZOZ/action/citation_signature","submit_replication":"https://pith.science/pith/ZFWKTEQ2PGSC5MKC7GXE52GZOZ/action/replication_record"}},"created_at":"2026-05-18T01:24:09.516374+00:00","updated_at":"2026-05-18T01:24:09.516374+00:00"}