{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:LK56UC26USOWO3F33KYGFA6Q2J","short_pith_number":"pith:LK56UC26","schema_version":"1.0","canonical_sha256":"5abbea0b5ea49d676cbbdab06283d0d2448a35d213534c6332be5c37537a44aa","source":{"kind":"arxiv","id":"1203.4611","version":2},"attestation_state":"computed","paper":{"title":"On the Sum Neccesary to Ensure that a Degree Sequence is Potentially H-Graphic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Casey K. Moffatt, Michael Ferrara, Paul S. Wenger, Timothy D. LeSaulnier","submitted_at":"2012-03-20T22:22:20Z","abstract_excerpt":"A sequence of nonnegative integers \\pi =(d_1,d_2,...,d_n) is graphic if there is a (simple) graph G with degree sequence \\pi. In this case, G is said to realize or be a realization of \\pi. Degree sequence results in the literature generally fall into two classes: forcible problems, in which all realizations of a graphic sequence must have a given property, and potential problems, in which at least one realization of \\pi must have the given property.\n  Given a graph H, a graphic sequence \\pi is potentially H-graphic if there is some realization of \\pi that contains H as a subgraph. In 1991, Erd"},"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":"1203.4611","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-03-20T22:22:20Z","cross_cats_sorted":[],"title_canon_sha256":"231b83e38504edf57cd0a4f5ab82147bbf71afe71bc0ef312c91c5d484d34465","abstract_canon_sha256":"ac49ce3fd4946014848d67268b0770dfcaf4ed8e028ca243b2698c1d93cdcd1c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:28:06.315909Z","signature_b64":"WI/eGbAG35d539uDzUW02eS001twmOWRlR3xkjQ8HpK/VjXROXjqF8xD/srjj6WuUUcMq0XoaPtQ9vO69nPdCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5abbea0b5ea49d676cbbdab06283d0d2448a35d213534c6332be5c37537a44aa","last_reissued_at":"2026-05-18T01:28:06.315280Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:28:06.315280Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Sum Neccesary to Ensure that a Degree Sequence is Potentially H-Graphic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Casey K. Moffatt, Michael Ferrara, Paul S. Wenger, Timothy D. LeSaulnier","submitted_at":"2012-03-20T22:22:20Z","abstract_excerpt":"A sequence of nonnegative integers \\pi =(d_1,d_2,...,d_n) is graphic if there is a (simple) graph G with degree sequence \\pi. In this case, G is said to realize or be a realization of \\pi. Degree sequence results in the literature generally fall into two classes: forcible problems, in which all realizations of a graphic sequence must have a given property, and potential problems, in which at least one realization of \\pi must have the given property.\n  Given a graph H, a graphic sequence \\pi is potentially H-graphic if there is some realization of \\pi that contains H as a subgraph. In 1991, Erd"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.4611","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":"1203.4611","created_at":"2026-05-18T01:28:06.315383+00:00"},{"alias_kind":"arxiv_version","alias_value":"1203.4611v2","created_at":"2026-05-18T01:28:06.315383+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.4611","created_at":"2026-05-18T01:28:06.315383+00:00"},{"alias_kind":"pith_short_12","alias_value":"LK56UC26USOW","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_16","alias_value":"LK56UC26USOWO3F3","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_8","alias_value":"LK56UC26","created_at":"2026-05-18T12:27:14.488303+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/LK56UC26USOWO3F33KYGFA6Q2J","json":"https://pith.science/pith/LK56UC26USOWO3F33KYGFA6Q2J.json","graph_json":"https://pith.science/api/pith-number/LK56UC26USOWO3F33KYGFA6Q2J/graph.json","events_json":"https://pith.science/api/pith-number/LK56UC26USOWO3F33KYGFA6Q2J/events.json","paper":"https://pith.science/paper/LK56UC26"},"agent_actions":{"view_html":"https://pith.science/pith/LK56UC26USOWO3F33KYGFA6Q2J","download_json":"https://pith.science/pith/LK56UC26USOWO3F33KYGFA6Q2J.json","view_paper":"https://pith.science/paper/LK56UC26","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1203.4611&json=true","fetch_graph":"https://pith.science/api/pith-number/LK56UC26USOWO3F33KYGFA6Q2J/graph.json","fetch_events":"https://pith.science/api/pith-number/LK56UC26USOWO3F33KYGFA6Q2J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LK56UC26USOWO3F33KYGFA6Q2J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LK56UC26USOWO3F33KYGFA6Q2J/action/storage_attestation","attest_author":"https://pith.science/pith/LK56UC26USOWO3F33KYGFA6Q2J/action/author_attestation","sign_citation":"https://pith.science/pith/LK56UC26USOWO3F33KYGFA6Q2J/action/citation_signature","submit_replication":"https://pith.science/pith/LK56UC26USOWO3F33KYGFA6Q2J/action/replication_record"}},"created_at":"2026-05-18T01:28:06.315383+00:00","updated_at":"2026-05-18T01:28:06.315383+00:00"}