{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:TDP2SKXXLNHSJM3MCLWXQN3XGE","short_pith_number":"pith:TDP2SKXX","canonical_record":{"source":{"id":"2009.10294","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-09-22T03:00:02Z","cross_cats_sorted":[],"title_canon_sha256":"de5b09cf706a62869f2e6163456fe3ca1f49a82db0e7454353bef5ca5580e444","abstract_canon_sha256":"eecbeae86f9dbfc5edb131634e0bf14f92962cfcc8c38317b23e7747bbc3047d"},"schema_version":"1.0"},"canonical_sha256":"98dfa92af75b4f24b36c12ed7837773107d554fda4ab12ccaafe6ff5bbe0f755","source":{"kind":"arxiv","id":"2009.10294","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2009.10294","created_at":"2026-07-05T09:32:37Z"},{"alias_kind":"arxiv_version","alias_value":"2009.10294v1","created_at":"2026-07-05T09:32:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2009.10294","created_at":"2026-07-05T09:32:37Z"},{"alias_kind":"pith_short_12","alias_value":"TDP2SKXXLNHS","created_at":"2026-07-05T09:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"TDP2SKXXLNHSJM3M","created_at":"2026-07-05T09:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"TDP2SKXX","created_at":"2026-07-05T09:32:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:TDP2SKXXLNHSJM3MCLWXQN3XGE","target":"record","payload":{"canonical_record":{"source":{"id":"2009.10294","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-09-22T03:00:02Z","cross_cats_sorted":[],"title_canon_sha256":"de5b09cf706a62869f2e6163456fe3ca1f49a82db0e7454353bef5ca5580e444","abstract_canon_sha256":"eecbeae86f9dbfc5edb131634e0bf14f92962cfcc8c38317b23e7747bbc3047d"},"schema_version":"1.0"},"canonical_sha256":"98dfa92af75b4f24b36c12ed7837773107d554fda4ab12ccaafe6ff5bbe0f755","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:32:37.889712Z","signature_b64":"X5bdT4eReIPei7UGa/jPG3Sn5b0YXRhftBIMPdy/KKBrJKKMCNDM2EAiHTw0niMN2ihK3Mykum+DkhN1Ang1Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"98dfa92af75b4f24b36c12ed7837773107d554fda4ab12ccaafe6ff5bbe0f755","last_reissued_at":"2026-07-05T09:32:37.889158Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:32:37.889158Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2009.10294","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:32:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rL5dF3Wi5uWeffFIedngBh4DQHSQhB2xFpHbW8GTl6LsbnjREAJ4wh8LBCypyZpSeddiqubtwtHZa8AvJkkvDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T18:33:33.949586Z"},"content_sha256":"85b6fe4910f8ae7188bbd2a1fb6f9e7e6a7d13c9393cd551b826a1b55260a24f","schema_version":"1.0","event_id":"sha256:85b6fe4910f8ae7188bbd2a1fb6f9e7e6a7d13c9393cd551b826a1b55260a24f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:TDP2SKXXLNHSJM3MCLWXQN3XGE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the least size of a graph with a given degree set -- II","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Aditya Sahdev, Amitabha Tripathi, Jai Moondra","submitted_at":"2020-09-22T03:00:02Z","abstract_excerpt":"The degree set of a finite simple graph $G$ is the set of distinct degrees of vertices of $G$. A theorem of Kapoor, Polimeni & Wall asserts that the least order of a graph with a given degree set $\\mathscr D$ is $1+\\max \\mathscr D$. Tripathi & Vijay considered the analogous problem concerning the least size of graphs with degree set $\\mathscr D$. We expand on their results, and determine the least size of graphs with degree set $\\mathscr D$ when (i) $\\min \\mathscr D \\mid d$ for each $d \\in \\mathscr D$; (ii) $\\min \\mathscr D=2$; (iii) $\\mathscr D=\\{m,m+1,\\ldots,n\\}$. In addition, given any $\\ma"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2009.10294","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/2009.10294/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:32:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y0lZ1AC3spfRveaZDhyKbhRgBH6R2uNNIUk2kJV06TNuwE/Qv810tU2ASgxoR6tZbiwvtQv97xOkzBavwGWKAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T18:33:33.950090Z"},"content_sha256":"6436ae97f4b3e0f18076565f0146c35b665e93102e40dcff7a954a64b89f4aee","schema_version":"1.0","event_id":"sha256:6436ae97f4b3e0f18076565f0146c35b665e93102e40dcff7a954a64b89f4aee"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TDP2SKXXLNHSJM3MCLWXQN3XGE/bundle.json","state_url":"https://pith.science/pith/TDP2SKXXLNHSJM3MCLWXQN3XGE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TDP2SKXXLNHSJM3MCLWXQN3XGE/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-08-03T18:33:33Z","links":{"resolver":"https://pith.science/pith/TDP2SKXXLNHSJM3MCLWXQN3XGE","bundle":"https://pith.science/pith/TDP2SKXXLNHSJM3MCLWXQN3XGE/bundle.json","state":"https://pith.science/pith/TDP2SKXXLNHSJM3MCLWXQN3XGE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TDP2SKXXLNHSJM3MCLWXQN3XGE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:TDP2SKXXLNHSJM3MCLWXQN3XGE","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":"eecbeae86f9dbfc5edb131634e0bf14f92962cfcc8c38317b23e7747bbc3047d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-09-22T03:00:02Z","title_canon_sha256":"de5b09cf706a62869f2e6163456fe3ca1f49a82db0e7454353bef5ca5580e444"},"schema_version":"1.0","source":{"id":"2009.10294","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2009.10294","created_at":"2026-07-05T09:32:37Z"},{"alias_kind":"arxiv_version","alias_value":"2009.10294v1","created_at":"2026-07-05T09:32:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2009.10294","created_at":"2026-07-05T09:32:37Z"},{"alias_kind":"pith_short_12","alias_value":"TDP2SKXXLNHS","created_at":"2026-07-05T09:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"TDP2SKXXLNHSJM3M","created_at":"2026-07-05T09:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"TDP2SKXX","created_at":"2026-07-05T09:32:37Z"}],"graph_snapshots":[{"event_id":"sha256:6436ae97f4b3e0f18076565f0146c35b665e93102e40dcff7a954a64b89f4aee","target":"graph","created_at":"2026-07-05T09:32:37Z","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/2009.10294/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The degree set of a finite simple graph $G$ is the set of distinct degrees of vertices of $G$. A theorem of Kapoor, Polimeni & Wall asserts that the least order of a graph with a given degree set $\\mathscr D$ is $1+\\max \\mathscr D$. Tripathi & Vijay considered the analogous problem concerning the least size of graphs with degree set $\\mathscr D$. We expand on their results, and determine the least size of graphs with degree set $\\mathscr D$ when (i) $\\min \\mathscr D \\mid d$ for each $d \\in \\mathscr D$; (ii) $\\min \\mathscr D=2$; (iii) $\\mathscr D=\\{m,m+1,\\ldots,n\\}$. In addition, given any $\\ma","authors_text":"Aditya Sahdev, Amitabha Tripathi, Jai Moondra","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-09-22T03:00:02Z","title":"On the least size of a graph with a given degree set -- II"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2009.10294","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:85b6fe4910f8ae7188bbd2a1fb6f9e7e6a7d13c9393cd551b826a1b55260a24f","target":"record","created_at":"2026-07-05T09:32:37Z","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":"eecbeae86f9dbfc5edb131634e0bf14f92962cfcc8c38317b23e7747bbc3047d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-09-22T03:00:02Z","title_canon_sha256":"de5b09cf706a62869f2e6163456fe3ca1f49a82db0e7454353bef5ca5580e444"},"schema_version":"1.0","source":{"id":"2009.10294","kind":"arxiv","version":1}},"canonical_sha256":"98dfa92af75b4f24b36c12ed7837773107d554fda4ab12ccaafe6ff5bbe0f755","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"98dfa92af75b4f24b36c12ed7837773107d554fda4ab12ccaafe6ff5bbe0f755","first_computed_at":"2026-07-05T09:32:37.889158Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:32:37.889158Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"X5bdT4eReIPei7UGa/jPG3Sn5b0YXRhftBIMPdy/KKBrJKKMCNDM2EAiHTw0niMN2ihK3Mykum+DkhN1Ang1Bw==","signature_status":"signed_v1","signed_at":"2026-07-05T09:32:37.889712Z","signed_message":"canonical_sha256_bytes"},"source_id":"2009.10294","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:85b6fe4910f8ae7188bbd2a1fb6f9e7e6a7d13c9393cd551b826a1b55260a24f","sha256:6436ae97f4b3e0f18076565f0146c35b665e93102e40dcff7a954a64b89f4aee"],"state_sha256":"45f93dcae2e1e85d0846df32726efaecf22a5069d2f1338b08ca0b34007b4068"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CFLWQDg0ZmdDJ7JQ8iP5/BqXboMo1voZhXZjWjZPcFFY6bEbhzHxO1N2NeRn8Nc5Bm1Q902aCtzVGvymLvSKAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T18:33:33.954856Z","bundle_sha256":"056945c923f43b1787a507c150609d82e8f46b256373bb1eeacb482b2685b0c9"}}