{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:3ZP4E5FYA77I7D2WKAYWWB2LFX","short_pith_number":"pith:3ZP4E5FY","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"},"canonical_sha256":"de5fc274b807fe8f8f5650316b074b2de7c727d18ea2fcba736b54dd2740c8af","source":{"kind":"arxiv","id":"2311.00110","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2311.00110","created_at":"2026-07-05T09:03:39Z"},{"alias_kind":"arxiv_version","alias_value":"2311.00110v1","created_at":"2026-07-05T09:03:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.00110","created_at":"2026-07-05T09:03:39Z"},{"alias_kind":"pith_short_12","alias_value":"3ZP4E5FYA77I","created_at":"2026-07-05T09:03:39Z"},{"alias_kind":"pith_short_16","alias_value":"3ZP4E5FYA77I7D2W","created_at":"2026-07-05T09:03:39Z"},{"alias_kind":"pith_short_8","alias_value":"3ZP4E5FY","created_at":"2026-07-05T09:03:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:3ZP4E5FYA77I7D2WKAYWWB2LFX","target":"record","payload":{"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"},"canonical_sha256":"de5fc274b807fe8f8f5650316b074b2de7c727d18ea2fcba736b54dd2740c8af","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"},"source_kind":"arxiv","source_id":"2311.00110","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T09:03:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l2ea1CkW65Iv/jRCDcFz8PFAJYQQ2/bECQjtPevCqCFPD5yH+jwX3vCk762xehbu0c2RNsTcMmfuq7kj3pWmBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T19:32:43.624623Z"},"content_sha256":"64843ec5f7554f6af08c062227ed71922ef0231c2773f7a6676a0a681bdd897a","schema_version":"1.0","event_id":"sha256:64843ec5f7554f6af08c062227ed71922ef0231c2773f7a6676a0a681bdd897a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:3ZP4E5FYA77I7D2WKAYWWB2LFX","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T09:03:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qC7bBakJ9clAxQ2/1l1dqFuXBbAdGtFABSTb2RoMoViwd/6Q4NMl3X61m1giEyOs0oQ9IeXkOH1mHPcm867JDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T19:32:43.624993Z"},"content_sha256":"373f0eabca2e5b291077c518faf713247cef17dfdd950957a5b5687c8c893539","schema_version":"1.0","event_id":"sha256:373f0eabca2e5b291077c518faf713247cef17dfdd950957a5b5687c8c893539"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3ZP4E5FYA77I7D2WKAYWWB2LFX/bundle.json","state_url":"https://pith.science/pith/3ZP4E5FYA77I7D2WKAYWWB2LFX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3ZP4E5FYA77I7D2WKAYWWB2LFX/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-06T19:32:43Z","links":{"resolver":"https://pith.science/pith/3ZP4E5FYA77I7D2WKAYWWB2LFX","bundle":"https://pith.science/pith/3ZP4E5FYA77I7D2WKAYWWB2LFX/bundle.json","state":"https://pith.science/pith/3ZP4E5FYA77I7D2WKAYWWB2LFX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3ZP4E5FYA77I7D2WKAYWWB2LFX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:3ZP4E5FYA77I7D2WKAYWWB2LFX","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":"00d3c14a78fba78fecf502c4c34df1e519dd169e6e586d175e8915c43cf232a1","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-10-31T19:37:03Z","title_canon_sha256":"14346a2a75365e42e8842cbb0716049746a144244f9a5bd4a7d1243e715bdca0"},"schema_version":"1.0","source":{"id":"2311.00110","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2311.00110","created_at":"2026-07-05T09:03:39Z"},{"alias_kind":"arxiv_version","alias_value":"2311.00110v1","created_at":"2026-07-05T09:03:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.00110","created_at":"2026-07-05T09:03:39Z"},{"alias_kind":"pith_short_12","alias_value":"3ZP4E5FYA77I","created_at":"2026-07-05T09:03:39Z"},{"alias_kind":"pith_short_16","alias_value":"3ZP4E5FYA77I7D2W","created_at":"2026-07-05T09:03:39Z"},{"alias_kind":"pith_short_8","alias_value":"3ZP4E5FY","created_at":"2026-07-05T09:03:39Z"}],"graph_snapshots":[{"event_id":"sha256:373f0eabca2e5b291077c518faf713247cef17dfdd950957a5b5687c8c893539","target":"graph","created_at":"2026-07-05T09:03:39Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2311.00110/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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.","authors_text":"John Talbot, Jun Yan","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-10-31T19:37:03Z","title":"Degree sequences of triangular multigraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.00110","kind":"arxiv","version":1},"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:64843ec5f7554f6af08c062227ed71922ef0231c2773f7a6676a0a681bdd897a","target":"record","created_at":"2026-07-05T09:03:39Z","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":"00d3c14a78fba78fecf502c4c34df1e519dd169e6e586d175e8915c43cf232a1","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-10-31T19:37:03Z","title_canon_sha256":"14346a2a75365e42e8842cbb0716049746a144244f9a5bd4a7d1243e715bdca0"},"schema_version":"1.0","source":{"id":"2311.00110","kind":"arxiv","version":1}},"canonical_sha256":"de5fc274b807fe8f8f5650316b074b2de7c727d18ea2fcba736b54dd2740c8af","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"de5fc274b807fe8f8f5650316b074b2de7c727d18ea2fcba736b54dd2740c8af","first_computed_at":"2026-07-05T09:03:39.730624Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:03:39.730624Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hoQWL8c+ueGy9PYNeyPeMIiU8ybbJQTbrYoo6G9OooFQq2aQ2rpKPnlRNYlsfEAhHu2F3tM0WxPHP2/uSa/yCg==","signature_status":"signed_v1","signed_at":"2026-07-05T09:03:39.731079Z","signed_message":"canonical_sha256_bytes"},"source_id":"2311.00110","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:64843ec5f7554f6af08c062227ed71922ef0231c2773f7a6676a0a681bdd897a","sha256:373f0eabca2e5b291077c518faf713247cef17dfdd950957a5b5687c8c893539"],"state_sha256":"8a8cda5d600be53e70fac48aaae8cffa8decfc54920f67b768568fae0144deb9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dHNOCPx+86bukdjJ8lr28wMuplg3xk8iGV0694Pzhdb2Zgwo4ewcmtRsphSu/jlEAyiBS+fgNCqiXhJObtVhAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T19:32:43.626974Z","bundle_sha256":"078f4f87a502fe56d6a448c47a727c881040473385e24dbe7cde9f6e46b1ca86"}}