{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2006:MYYPIQPSXR4WW5C6ATI66BWWPA","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"8774fc707ae70958bd985cd5d1c32cce093ae0bbde49d80bd3acf149a2d3594b","cross_cats_sorted":["math.CO"],"license":"","primary_cat":"cs.DM","submitted_at":"2006-05-03T16:57:21Z","title_canon_sha256":"830090748690c111e5bd6fda73bf45c2f3332caedac9c650f4e66e54ef399430"},"schema_version":"1.0","source":{"id":"cs/0605011","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0605011","created_at":"2026-05-18T03:42:34Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0605011v2","created_at":"2026-05-18T03:42:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0605011","created_at":"2026-05-18T03:42:34Z"},{"alias_kind":"pith_short_12","alias_value":"MYYPIQPSXR4W","created_at":"2026-05-18T12:25:54Z"},{"alias_kind":"pith_short_16","alias_value":"MYYPIQPSXR4WW5C6","created_at":"2026-05-18T12:25:54Z"},{"alias_kind":"pith_short_8","alias_value":"MYYPIQPS","created_at":"2026-05-18T12:25:54Z"}],"graph_snapshots":[{"event_id":"sha256:347a4e8bbc95ad9c67191a86d6636cab721d3eb7d1a9c3d89e911cc176fb8792","target":"graph","created_at":"2026-05-18T03:42:34Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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.","authors_text":"Danny Krizanc, David R. Wood, Pat Morin, Prosenjit Bose, Stefanie Wuhrer, Stefan Langerman, Vida Dujmovi\\'c","cross_cats":["math.CO"],"headline":"","license":"","primary_cat":"cs.DM","submitted_at":"2006-05-03T16:57:21Z","title":"A Characterization of the Degree Sequences of 2-Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0605011","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:938737d6d0c5e044671a5379b7e42b0c711419e897ff624bd981e4bd7b3ad4ef","target":"record","created_at":"2026-05-18T03:42:34Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"8774fc707ae70958bd985cd5d1c32cce093ae0bbde49d80bd3acf149a2d3594b","cross_cats_sorted":["math.CO"],"license":"","primary_cat":"cs.DM","submitted_at":"2006-05-03T16:57:21Z","title_canon_sha256":"830090748690c111e5bd6fda73bf45c2f3332caedac9c650f4e66e54ef399430"},"schema_version":"1.0","source":{"id":"cs/0605011","kind":"arxiv","version":2}},"canonical_sha256":"6630f441f2bc796b745e04d1ef06d6780ed81b6f8e4211ebcd76b3d92f6394aa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6630f441f2bc796b745e04d1ef06d6780ed81b6f8e4211ebcd76b3d92f6394aa","first_computed_at":"2026-05-18T03:42:34.409774Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:42:34.409774Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8Pn9W7IKUYVpzz8B55AMw2+9CZB9mswsYzgxWFCqTFgpH5fTyTfq+Wkv/soDkFP8K0o1xlgNbLYB0bN/5RpBCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:42:34.410369Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0605011","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:938737d6d0c5e044671a5379b7e42b0c711419e897ff624bd981e4bd7b3ad4ef","sha256:347a4e8bbc95ad9c67191a86d6636cab721d3eb7d1a9c3d89e911cc176fb8792"],"state_sha256":"08c98f15d69231d29b1588843825917dbf4df2db87a6c95f5f0d702d9e696b43"}