{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2006:MYYPIQPSXR4WW5C6ATI66BWWPA","short_pith_number":"pith:MYYPIQPS","schema_version":"1.0","canonical_sha256":"6630f441f2bc796b745e04d1ef06d6780ed81b6f8e4211ebcd76b3d92f6394aa","source":{"kind":"arxiv","id":"cs/0605011","version":2},"attestation_state":"computed","paper":{"title":"A Characterization of the Degree Sequences of 2-Trees","license":"","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Danny Krizanc, David R. Wood, Pat Morin, Prosenjit Bose, Stefanie Wuhrer, Stefan Langerman, Vida Dujmovi\\'c","submitted_at":"2006-05-03T16:57:21Z","abstract_excerpt":"A graph G is a 2-tree if G=K_3, or G has a vertex v of degree 2, whose neighbours are adjacent, and G\\v{i}s a 2-tree. A characterization of the degree sequences of 2-trees is given. This characterization yields a linear-time algorithm for recognizing and realizing degree sequences of 2-trees."},"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":"cs/0605011","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"cs.DM","submitted_at":"2006-05-03T16:57:21Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"830090748690c111e5bd6fda73bf45c2f3332caedac9c650f4e66e54ef399430","abstract_canon_sha256":"8774fc707ae70958bd985cd5d1c32cce093ae0bbde49d80bd3acf149a2d3594b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:42:34.410369Z","signature_b64":"8Pn9W7IKUYVpzz8B55AMw2+9CZB9mswsYzgxWFCqTFgpH5fTyTfq+Wkv/soDkFP8K0o1xlgNbLYB0bN/5RpBCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6630f441f2bc796b745e04d1ef06d6780ed81b6f8e4211ebcd76b3d92f6394aa","last_reissued_at":"2026-05-18T03:42:34.409774Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:42:34.409774Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Characterization of the Degree Sequences of 2-Trees","license":"","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Danny Krizanc, David R. Wood, Pat Morin, Prosenjit Bose, Stefanie Wuhrer, Stefan Langerman, Vida Dujmovi\\'c","submitted_at":"2006-05-03T16:57:21Z","abstract_excerpt":"A graph G is a 2-tree if G=K_3, or G has a vertex v of degree 2, whose neighbours are adjacent, and G\\v{i}s a 2-tree. A characterization of the degree sequences of 2-trees is given. This characterization yields a linear-time algorithm for recognizing and realizing degree sequences of 2-trees."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0605011","kind":"arxiv","version":2},"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":"cs/0605011","created_at":"2026-05-18T03:42:34.409853+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0605011v2","created_at":"2026-05-18T03:42:34.409853+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0605011","created_at":"2026-05-18T03:42:34.409853+00:00"},{"alias_kind":"pith_short_12","alias_value":"MYYPIQPSXR4W","created_at":"2026-05-18T12:25:54.717736+00:00"},{"alias_kind":"pith_short_16","alias_value":"MYYPIQPSXR4WW5C6","created_at":"2026-05-18T12:25:54.717736+00:00"},{"alias_kind":"pith_short_8","alias_value":"MYYPIQPS","created_at":"2026-05-18T12:25:54.717736+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/MYYPIQPSXR4WW5C6ATI66BWWPA","json":"https://pith.science/pith/MYYPIQPSXR4WW5C6ATI66BWWPA.json","graph_json":"https://pith.science/api/pith-number/MYYPIQPSXR4WW5C6ATI66BWWPA/graph.json","events_json":"https://pith.science/api/pith-number/MYYPIQPSXR4WW5C6ATI66BWWPA/events.json","paper":"https://pith.science/paper/MYYPIQPS"},"agent_actions":{"view_html":"https://pith.science/pith/MYYPIQPSXR4WW5C6ATI66BWWPA","download_json":"https://pith.science/pith/MYYPIQPSXR4WW5C6ATI66BWWPA.json","view_paper":"https://pith.science/paper/MYYPIQPS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0605011&json=true","fetch_graph":"https://pith.science/api/pith-number/MYYPIQPSXR4WW5C6ATI66BWWPA/graph.json","fetch_events":"https://pith.science/api/pith-number/MYYPIQPSXR4WW5C6ATI66BWWPA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MYYPIQPSXR4WW5C6ATI66BWWPA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MYYPIQPSXR4WW5C6ATI66BWWPA/action/storage_attestation","attest_author":"https://pith.science/pith/MYYPIQPSXR4WW5C6ATI66BWWPA/action/author_attestation","sign_citation":"https://pith.science/pith/MYYPIQPSXR4WW5C6ATI66BWWPA/action/citation_signature","submit_replication":"https://pith.science/pith/MYYPIQPSXR4WW5C6ATI66BWWPA/action/replication_record"}},"created_at":"2026-05-18T03:42:34.409853+00:00","updated_at":"2026-05-18T03:42:34.409853+00:00"}