{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:HVO2RWCHLEJF3OWYO2JEMHCWC2","short_pith_number":"pith:HVO2RWCH","schema_version":"1.0","canonical_sha256":"3d5da8d84759125dbad87692461c5616848db044ba285207174e70dec9e73130","source":{"kind":"arxiv","id":"1605.05857","version":2},"attestation_state":"computed","paper":{"title":"Terminal-Pairability in Complete Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ervin Gy\\\"ori, G\\'abor M\\'esz\\'aros, Tam\\'as R\\'obert Mezei","submitted_at":"2016-05-19T09:03:38Z","abstract_excerpt":"We investigate terminal-pairability properties of complete graphs and improve the known bounds in two open problems. We prove that the complete graph $K_n$ on $n$ vertices is terminal-pairable if the maximum degree $\\Delta$ of the corresponding demand graph $D$ is at most $2\\lfloor\\frac{n}{6}\\rfloor-2$. We also verify the terminal-pairability property when the number of edges in $D$ does not exceed $2n-5$ and $\\Delta\\leq n-1$ holds."},"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":"1605.05857","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-19T09:03:38Z","cross_cats_sorted":[],"title_canon_sha256":"e471cc6c2ce827483ab5df5b41aa612c8288269a7c03b2ef55fc00157c811964","abstract_canon_sha256":"7667503bf4dbacc21dca485b05407c1525248723c66c02b6a996e4af539cc892"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:50.556746Z","signature_b64":"FQnzUkZPZOEMYS+4eCf9W0Mwq+Ph6CjfyzjxoLH8U4ZgtwxeShVjuGWH7VMzeoCmTmTCM2ZxFf9B2YiBXuhaCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3d5da8d84759125dbad87692461c5616848db044ba285207174e70dec9e73130","last_reissued_at":"2026-05-17T23:58:50.556091Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:50.556091Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Terminal-Pairability in Complete Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ervin Gy\\\"ori, G\\'abor M\\'esz\\'aros, Tam\\'as R\\'obert Mezei","submitted_at":"2016-05-19T09:03:38Z","abstract_excerpt":"We investigate terminal-pairability properties of complete graphs and improve the known bounds in two open problems. We prove that the complete graph $K_n$ on $n$ vertices is terminal-pairable if the maximum degree $\\Delta$ of the corresponding demand graph $D$ is at most $2\\lfloor\\frac{n}{6}\\rfloor-2$. We also verify the terminal-pairability property when the number of edges in $D$ does not exceed $2n-5$ and $\\Delta\\leq n-1$ holds."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.05857","kind":"arxiv","version":2},"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":"1605.05857","created_at":"2026-05-17T23:58:50.556181+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.05857v2","created_at":"2026-05-17T23:58:50.556181+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.05857","created_at":"2026-05-17T23:58:50.556181+00:00"},{"alias_kind":"pith_short_12","alias_value":"HVO2RWCHLEJF","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_16","alias_value":"HVO2RWCHLEJF3OWY","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_8","alias_value":"HVO2RWCH","created_at":"2026-05-18T12:30:22.444734+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/HVO2RWCHLEJF3OWYO2JEMHCWC2","json":"https://pith.science/pith/HVO2RWCHLEJF3OWYO2JEMHCWC2.json","graph_json":"https://pith.science/api/pith-number/HVO2RWCHLEJF3OWYO2JEMHCWC2/graph.json","events_json":"https://pith.science/api/pith-number/HVO2RWCHLEJF3OWYO2JEMHCWC2/events.json","paper":"https://pith.science/paper/HVO2RWCH"},"agent_actions":{"view_html":"https://pith.science/pith/HVO2RWCHLEJF3OWYO2JEMHCWC2","download_json":"https://pith.science/pith/HVO2RWCHLEJF3OWYO2JEMHCWC2.json","view_paper":"https://pith.science/paper/HVO2RWCH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.05857&json=true","fetch_graph":"https://pith.science/api/pith-number/HVO2RWCHLEJF3OWYO2JEMHCWC2/graph.json","fetch_events":"https://pith.science/api/pith-number/HVO2RWCHLEJF3OWYO2JEMHCWC2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HVO2RWCHLEJF3OWYO2JEMHCWC2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HVO2RWCHLEJF3OWYO2JEMHCWC2/action/storage_attestation","attest_author":"https://pith.science/pith/HVO2RWCHLEJF3OWYO2JEMHCWC2/action/author_attestation","sign_citation":"https://pith.science/pith/HVO2RWCHLEJF3OWYO2JEMHCWC2/action/citation_signature","submit_replication":"https://pith.science/pith/HVO2RWCHLEJF3OWYO2JEMHCWC2/action/replication_record"}},"created_at":"2026-05-17T23:58:50.556181+00:00","updated_at":"2026-05-17T23:58:50.556181+00:00"}