{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:C7P5ZSPV53SHKJYD47SNHZGEVC","short_pith_number":"pith:C7P5ZSPV","schema_version":"1.0","canonical_sha256":"17dfdcc9f5eee4752703e7e4d3e4c4a8a105344b6a2ef9aecb859b52fcb652a7","source":{"kind":"arxiv","id":"1708.06837","version":1},"attestation_state":"computed","paper":{"title":"An improved upper bound on the maximum degree of terminal-pairable complete graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ant\\'onio Gir\\~ao, G\\'abor M\\'esz\\'aros","submitted_at":"2017-08-22T22:03:12Z","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."},"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":"1708.06837","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-22T22:03:12Z","cross_cats_sorted":[],"title_canon_sha256":"78ad4c7ac9297ef778875053be715fde614eb6db7267b131cd119424868ebc27","abstract_canon_sha256":"06a6f79615b07372f87117c51fc682da3686d54c1b0791778f8b0928cdb70aed"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:49.058401Z","signature_b64":"0DyAr97XAdlJdLxSCksel0G8NQvgSKGrcVL8Oo2jZGqCQQ0xeA/e1HiIG971P4djHNGIeo+3JgVVpljRBCJCBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"17dfdcc9f5eee4752703e7e4d3e4c4a8a105344b6a2ef9aecb859b52fcb652a7","last_reissued_at":"2026-05-18T00:36:49.057951Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:49.057951Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An improved upper bound on the maximum degree of terminal-pairable complete graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ant\\'onio Gir\\~ao, G\\'abor M\\'esz\\'aros","submitted_at":"2017-08-22T22:03:12Z","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."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.06837","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":""},"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":"1708.06837","created_at":"2026-05-18T00:36:49.058014+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.06837v1","created_at":"2026-05-18T00:36:49.058014+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.06837","created_at":"2026-05-18T00:36:49.058014+00:00"},{"alias_kind":"pith_short_12","alias_value":"C7P5ZSPV53SH","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_16","alias_value":"C7P5ZSPV53SHKJYD","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_8","alias_value":"C7P5ZSPV","created_at":"2026-05-18T12:31:10.602751+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/C7P5ZSPV53SHKJYD47SNHZGEVC","json":"https://pith.science/pith/C7P5ZSPV53SHKJYD47SNHZGEVC.json","graph_json":"https://pith.science/api/pith-number/C7P5ZSPV53SHKJYD47SNHZGEVC/graph.json","events_json":"https://pith.science/api/pith-number/C7P5ZSPV53SHKJYD47SNHZGEVC/events.json","paper":"https://pith.science/paper/C7P5ZSPV"},"agent_actions":{"view_html":"https://pith.science/pith/C7P5ZSPV53SHKJYD47SNHZGEVC","download_json":"https://pith.science/pith/C7P5ZSPV53SHKJYD47SNHZGEVC.json","view_paper":"https://pith.science/paper/C7P5ZSPV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.06837&json=true","fetch_graph":"https://pith.science/api/pith-number/C7P5ZSPV53SHKJYD47SNHZGEVC/graph.json","fetch_events":"https://pith.science/api/pith-number/C7P5ZSPV53SHKJYD47SNHZGEVC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C7P5ZSPV53SHKJYD47SNHZGEVC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C7P5ZSPV53SHKJYD47SNHZGEVC/action/storage_attestation","attest_author":"https://pith.science/pith/C7P5ZSPV53SHKJYD47SNHZGEVC/action/author_attestation","sign_citation":"https://pith.science/pith/C7P5ZSPV53SHKJYD47SNHZGEVC/action/citation_signature","submit_replication":"https://pith.science/pith/C7P5ZSPV53SHKJYD47SNHZGEVC/action/replication_record"}},"created_at":"2026-05-18T00:36:49.058014+00:00","updated_at":"2026-05-18T00:36:49.058014+00:00"}