{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:ESR3BTZSUFAGO6C6XK5BFJYSMM","short_pith_number":"pith:ESR3BTZS","schema_version":"1.0","canonical_sha256":"24a3b0cf32a14067785ebaba12a7126338fb6a777de60ddae59482f9a6b35b8d","source":{"kind":"arxiv","id":"1512.05682","version":1},"attestation_state":"computed","paper":{"title":"k-connected 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:25:38Z","abstract_excerpt":"Necessary and sufficient conditions for a sequence of positive integers to be the degree sequence of a k-connected simple graph are detailed. Conditions are also given under which such a sequence is necessarily k-connected."},"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.05682","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-12-17T17:25:38Z","cross_cats_sorted":[],"title_canon_sha256":"ee0cf04c9fb025a1ae8936993e953e69fd4665aa409ba823278ed76aea53baea","abstract_canon_sha256":"f35c2997277e96c3b747691f7c8824a88638ea75e13ef7e4b8b178691079f795"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:24:09.174254Z","signature_b64":"0zobOBmhgAeyvjXjh3oHuqIPG5bzmPgC2KI12M4ZPfyRAi3jp2z20jCJKxztjs01ILMh/uwgaD68dxmNasCrBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"24a3b0cf32a14067785ebaba12a7126338fb6a777de60ddae59482f9a6b35b8d","last_reissued_at":"2026-05-18T01:24:09.173592Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:24:09.173592Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"k-connected 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:25:38Z","abstract_excerpt":"Necessary and sufficient conditions for a sequence of positive integers to be the degree sequence of a k-connected simple graph are detailed. Conditions are also given under which such a sequence is necessarily k-connected."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.05682","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.05682","created_at":"2026-05-18T01:24:09.173700+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.05682v1","created_at":"2026-05-18T01:24:09.173700+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.05682","created_at":"2026-05-18T01:24:09.173700+00:00"},{"alias_kind":"pith_short_12","alias_value":"ESR3BTZSUFAG","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_16","alias_value":"ESR3BTZSUFAGO6C6","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_8","alias_value":"ESR3BTZS","created_at":"2026-05-18T12:29:19.899920+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/ESR3BTZSUFAGO6C6XK5BFJYSMM","json":"https://pith.science/pith/ESR3BTZSUFAGO6C6XK5BFJYSMM.json","graph_json":"https://pith.science/api/pith-number/ESR3BTZSUFAGO6C6XK5BFJYSMM/graph.json","events_json":"https://pith.science/api/pith-number/ESR3BTZSUFAGO6C6XK5BFJYSMM/events.json","paper":"https://pith.science/paper/ESR3BTZS"},"agent_actions":{"view_html":"https://pith.science/pith/ESR3BTZSUFAGO6C6XK5BFJYSMM","download_json":"https://pith.science/pith/ESR3BTZSUFAGO6C6XK5BFJYSMM.json","view_paper":"https://pith.science/paper/ESR3BTZS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.05682&json=true","fetch_graph":"https://pith.science/api/pith-number/ESR3BTZSUFAGO6C6XK5BFJYSMM/graph.json","fetch_events":"https://pith.science/api/pith-number/ESR3BTZSUFAGO6C6XK5BFJYSMM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ESR3BTZSUFAGO6C6XK5BFJYSMM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ESR3BTZSUFAGO6C6XK5BFJYSMM/action/storage_attestation","attest_author":"https://pith.science/pith/ESR3BTZSUFAGO6C6XK5BFJYSMM/action/author_attestation","sign_citation":"https://pith.science/pith/ESR3BTZSUFAGO6C6XK5BFJYSMM/action/citation_signature","submit_replication":"https://pith.science/pith/ESR3BTZSUFAGO6C6XK5BFJYSMM/action/replication_record"}},"created_at":"2026-05-18T01:24:09.173700+00:00","updated_at":"2026-05-18T01:24:09.173700+00:00"}