{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:HVO2RWCHLEJF3OWYO2JEMHCWC2","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":"7667503bf4dbacc21dca485b05407c1525248723c66c02b6a996e4af539cc892","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-19T09:03:38Z","title_canon_sha256":"e471cc6c2ce827483ab5df5b41aa612c8288269a7c03b2ef55fc00157c811964"},"schema_version":"1.0","source":{"id":"1605.05857","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.05857","created_at":"2026-05-17T23:58:50Z"},{"alias_kind":"arxiv_version","alias_value":"1605.05857v2","created_at":"2026-05-17T23:58:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.05857","created_at":"2026-05-17T23:58:50Z"},{"alias_kind":"pith_short_12","alias_value":"HVO2RWCHLEJF","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"HVO2RWCHLEJF3OWY","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"HVO2RWCH","created_at":"2026-05-18T12:30:22Z"}],"graph_snapshots":[{"event_id":"sha256:31ba0e40357ed99e3a22c50fd9fa5ddd04d0943f195148a0aec7602206bd1c6e","target":"graph","created_at":"2026-05-17T23:58:50Z","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":"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.","authors_text":"Ervin Gy\\\"ori, G\\'abor M\\'esz\\'aros, Tam\\'as R\\'obert Mezei","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-19T09:03:38Z","title":"Terminal-Pairability in Complete Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.05857","kind":"arxiv","version":2},"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:ca6fe353d76dec5f51d62141b30e98916d12c07638cdef584142c5a827732f28","target":"record","created_at":"2026-05-17T23:58:50Z","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":"7667503bf4dbacc21dca485b05407c1525248723c66c02b6a996e4af539cc892","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-19T09:03:38Z","title_canon_sha256":"e471cc6c2ce827483ab5df5b41aa612c8288269a7c03b2ef55fc00157c811964"},"schema_version":"1.0","source":{"id":"1605.05857","kind":"arxiv","version":2}},"canonical_sha256":"3d5da8d84759125dbad87692461c5616848db044ba285207174e70dec9e73130","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3d5da8d84759125dbad87692461c5616848db044ba285207174e70dec9e73130","first_computed_at":"2026-05-17T23:58:50.556091Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:58:50.556091Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FQnzUkZPZOEMYS+4eCf9W0Mwq+Ph6CjfyzjxoLH8U4ZgtwxeShVjuGWH7VMzeoCmTmTCM2ZxFf9B2YiBXuhaCQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:58:50.556746Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.05857","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ca6fe353d76dec5f51d62141b30e98916d12c07638cdef584142c5a827732f28","sha256:31ba0e40357ed99e3a22c50fd9fa5ddd04d0943f195148a0aec7602206bd1c6e"],"state_sha256":"5fb226dc88fd790b89f9761a87e5039763356dfef28c3e22cb89c575988fee03"}