{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:C7P5ZSPV53SHKJYD47SNHZGEVC","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":"06a6f79615b07372f87117c51fc682da3686d54c1b0791778f8b0928cdb70aed","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-22T22:03:12Z","title_canon_sha256":"78ad4c7ac9297ef778875053be715fde614eb6db7267b131cd119424868ebc27"},"schema_version":"1.0","source":{"id":"1708.06837","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.06837","created_at":"2026-05-18T00:36:49Z"},{"alias_kind":"arxiv_version","alias_value":"1708.06837v1","created_at":"2026-05-18T00:36:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.06837","created_at":"2026-05-18T00:36:49Z"},{"alias_kind":"pith_short_12","alias_value":"C7P5ZSPV53SH","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"C7P5ZSPV53SHKJYD","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"C7P5ZSPV","created_at":"2026-05-18T12:31:10Z"}],"graph_snapshots":[{"event_id":"sha256:52ee180da5d7543e17d140de1c80a677977ae45c943f34d8c5f78712c5f55cb2","target":"graph","created_at":"2026-05-18T00:36:49Z","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 terminal-pairable with respect to a demand multigraph $D$ on the same vertex set as $G$, if there exists edge-disjoint paths joining the end vertices of every demand edge of $D$. In this short note, we improve the upper bound on the largest $\\Delta(n)$ with the property that the complete graph on $n$ vertices is terminal-pairable with respect to any demand multigraph of maximum degree at most $\\Delta(n)$. This disproves a conjecture originally stated by Csaba, Faudree, Gy\\'arf\\'as, Lehel and Schelp.","authors_text":"Ant\\'onio Gir\\~ao, G\\'abor M\\'esz\\'aros","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-22T22:03:12Z","title":"An improved upper bound on the maximum degree of terminal-pairable complete graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.06837","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:e056665df7bb4f576b8270738f63e2abfcb2513197b6571b3b6dc2bad999761b","target":"record","created_at":"2026-05-18T00:36:49Z","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":"06a6f79615b07372f87117c51fc682da3686d54c1b0791778f8b0928cdb70aed","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-22T22:03:12Z","title_canon_sha256":"78ad4c7ac9297ef778875053be715fde614eb6db7267b131cd119424868ebc27"},"schema_version":"1.0","source":{"id":"1708.06837","kind":"arxiv","version":1}},"canonical_sha256":"17dfdcc9f5eee4752703e7e4d3e4c4a8a105344b6a2ef9aecb859b52fcb652a7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"17dfdcc9f5eee4752703e7e4d3e4c4a8a105344b6a2ef9aecb859b52fcb652a7","first_computed_at":"2026-05-18T00:36:49.057951Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:36:49.057951Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0DyAr97XAdlJdLxSCksel0G8NQvgSKGrcVL8Oo2jZGqCQQ0xeA/e1HiIG971P4djHNGIeo+3JgVVpljRBCJCBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:36:49.058401Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.06837","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e056665df7bb4f576b8270738f63e2abfcb2513197b6571b3b6dc2bad999761b","sha256:52ee180da5d7543e17d140de1c80a677977ae45c943f34d8c5f78712c5f55cb2"],"state_sha256":"edbcbfffb6c1af49e4345f0d2c7f4871007412a47f9ed4e882300195d8ac716f"}