{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:3ZP4E5FYA77I7D2WKAYWWB2LFX","short_pith_number":"pith:3ZP4E5FY","schema_version":"1.0","canonical_sha256":"de5fc274b807fe8f8f5650316b074b2de7c727d18ea2fcba736b54dd2740c8af","source":{"kind":"arxiv","id":"2311.00110","version":1},"attestation_state":"computed","paper":{"title":"Degree sequences of triangular multigraphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"John Talbot, Jun Yan","submitted_at":"2023-10-31T19:37:03Z","abstract_excerpt":"A simple graph is triangular if every edge is contained in a triangle. A sequence of integers is graphical if it is the degree sequence of a simple graph. Egan and Nikolayevsky recently conjectured that every graphical sequence whose terms are all at least 4 is the degree sequence of a triangular simple graph, and proved this in some special cases. In this paper we state and prove the analogous version of this conjecture for multigraphs."},"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":"2311.00110","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-10-31T19:37:03Z","cross_cats_sorted":[],"title_canon_sha256":"14346a2a75365e42e8842cbb0716049746a144244f9a5bd4a7d1243e715bdca0","abstract_canon_sha256":"00d3c14a78fba78fecf502c4c34df1e519dd169e6e586d175e8915c43cf232a1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:03:39.731079Z","signature_b64":"hoQWL8c+ueGy9PYNeyPeMIiU8ybbJQTbrYoo6G9OooFQq2aQ2rpKPnlRNYlsfEAhHu2F3tM0WxPHP2/uSa/yCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"de5fc274b807fe8f8f5650316b074b2de7c727d18ea2fcba736b54dd2740c8af","last_reissued_at":"2026-07-05T09:03:39.730624Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:03:39.730624Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Degree sequences of triangular multigraphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"John Talbot, Jun Yan","submitted_at":"2023-10-31T19:37:03Z","abstract_excerpt":"A simple graph is triangular if every edge is contained in a triangle. A sequence of integers is graphical if it is the degree sequence of a simple graph. Egan and Nikolayevsky recently conjectured that every graphical sequence whose terms are all at least 4 is the degree sequence of a triangular simple graph, and proved this in some special cases. In this paper we state and prove the analogous version of this conjecture for multigraphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.00110","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2311.00110/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2311.00110","created_at":"2026-07-05T09:03:39.730685+00:00"},{"alias_kind":"arxiv_version","alias_value":"2311.00110v1","created_at":"2026-07-05T09:03:39.730685+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.00110","created_at":"2026-07-05T09:03:39.730685+00:00"},{"alias_kind":"pith_short_12","alias_value":"3ZP4E5FYA77I","created_at":"2026-07-05T09:03:39.730685+00:00"},{"alias_kind":"pith_short_16","alias_value":"3ZP4E5FYA77I7D2W","created_at":"2026-07-05T09:03:39.730685+00:00"},{"alias_kind":"pith_short_8","alias_value":"3ZP4E5FY","created_at":"2026-07-05T09:03:39.730685+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/3ZP4E5FYA77I7D2WKAYWWB2LFX","json":"https://pith.science/pith/3ZP4E5FYA77I7D2WKAYWWB2LFX.json","graph_json":"https://pith.science/api/pith-number/3ZP4E5FYA77I7D2WKAYWWB2LFX/graph.json","events_json":"https://pith.science/api/pith-number/3ZP4E5FYA77I7D2WKAYWWB2LFX/events.json","paper":"https://pith.science/paper/3ZP4E5FY"},"agent_actions":{"view_html":"https://pith.science/pith/3ZP4E5FYA77I7D2WKAYWWB2LFX","download_json":"https://pith.science/pith/3ZP4E5FYA77I7D2WKAYWWB2LFX.json","view_paper":"https://pith.science/paper/3ZP4E5FY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2311.00110&json=true","fetch_graph":"https://pith.science/api/pith-number/3ZP4E5FYA77I7D2WKAYWWB2LFX/graph.json","fetch_events":"https://pith.science/api/pith-number/3ZP4E5FYA77I7D2WKAYWWB2LFX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3ZP4E5FYA77I7D2WKAYWWB2LFX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3ZP4E5FYA77I7D2WKAYWWB2LFX/action/storage_attestation","attest_author":"https://pith.science/pith/3ZP4E5FYA77I7D2WKAYWWB2LFX/action/author_attestation","sign_citation":"https://pith.science/pith/3ZP4E5FYA77I7D2WKAYWWB2LFX/action/citation_signature","submit_replication":"https://pith.science/pith/3ZP4E5FYA77I7D2WKAYWWB2LFX/action/replication_record"}},"created_at":"2026-07-05T09:03:39.730685+00:00","updated_at":"2026-07-05T09:03:39.730685+00:00"}