{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:ZHTGUJ6IU7TQGF2POZLO7V6IMA","short_pith_number":"pith:ZHTGUJ6I","canonical_record":{"source":{"id":"1705.02124","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-05T08:38:19Z","cross_cats_sorted":[],"title_canon_sha256":"eb70a55d36e7d5e38471868e1a17c0bec8bef77a446c1acc89b35b8804030e10","abstract_canon_sha256":"c61f0bb7a4ea8edabbaf49c9772c93e97f2db043238368ee20c23e361a558bfa"},"schema_version":"1.0"},"canonical_sha256":"c9e66a27c8a7e703174f7656efd7c8603ff583b39ac240cb0a724eb8f0a06017","source":{"kind":"arxiv","id":"1705.02124","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.02124","created_at":"2026-07-05T00:56:22Z"},{"alias_kind":"arxiv_version","alias_value":"1705.02124v4","created_at":"2026-07-05T00:56:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.02124","created_at":"2026-07-05T00:56:22Z"},{"alias_kind":"pith_short_12","alias_value":"ZHTGUJ6IU7TQ","created_at":"2026-07-05T00:56:22Z"},{"alias_kind":"pith_short_16","alias_value":"ZHTGUJ6IU7TQGF2P","created_at":"2026-07-05T00:56:22Z"},{"alias_kind":"pith_short_8","alias_value":"ZHTGUJ6I","created_at":"2026-07-05T00:56:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:ZHTGUJ6IU7TQGF2POZLO7V6IMA","target":"record","payload":{"canonical_record":{"source":{"id":"1705.02124","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-05T08:38:19Z","cross_cats_sorted":[],"title_canon_sha256":"eb70a55d36e7d5e38471868e1a17c0bec8bef77a446c1acc89b35b8804030e10","abstract_canon_sha256":"c61f0bb7a4ea8edabbaf49c9772c93e97f2db043238368ee20c23e361a558bfa"},"schema_version":"1.0"},"canonical_sha256":"c9e66a27c8a7e703174f7656efd7c8603ff583b39ac240cb0a724eb8f0a06017","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:56:22.200446Z","signature_b64":"2Gowm6FCyiUS3CPvJmEuV/r/k9N2fk63gVhNgt7NolznLmcurOvWh2A8Wkvt7xkGsGJZIYEpKO+K/7mDLWidCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c9e66a27c8a7e703174f7656efd7c8603ff583b39ac240cb0a724eb8f0a06017","last_reissued_at":"2026-07-05T00:56:22.199970Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:56:22.199970Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.02124","source_version":4,"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-05T00:56:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wSIzCMxsWW+YDpyTHnzSZZJX4Oca6B1Eeip69q+sCeRFvG5iPLFx8wVsTxgOAR8ielwctIe7/JSvm/iGr/jmBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T12:14:46.812773Z"},"content_sha256":"83178262e0ee64cfb9503a83fed9b82762734b6b44c5de6f2c9a1749afdb4844","schema_version":"1.0","event_id":"sha256:83178262e0ee64cfb9503a83fed9b82762734b6b44c5de6f2c9a1749afdb4844"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:ZHTGUJ6IU7TQGF2POZLO7V6IMA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Terminal-Pairability in Complete Bipartite Graphs with Non-Bipartite Demands","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ervin Gy\\H{o}ri, Lucas Colucci, P\\'eter L. Erd\\H{o}s, Tam\\'as R\\'obert Mezei","submitted_at":"2017-05-05T08:38:19Z","abstract_excerpt":"We investigate the terminal-pairability problem in the case when the base graph is a complete bipartite graph, and the demand graph is a (not necessarily bipartite) multigraph on the same vertex set. In computer science, this problem is known as the edge-disjoint paths problem. We improve the lower bound on the maximum value of $\\Delta(D)$ which still guarantees that the demand graph $D$ has a realization in $K_{n,n}$. We also solve the extremal problem on the number of edges, i.e., we determine the maximum number of edges which guarantees that a demand graph is realizable in $K_{n,n}$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.02124","kind":"arxiv","version":4},"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/1705.02124/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-05T00:56:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sTXKlhplgzOiyRS+HQwryKnKWvzqNElMB3oZ3TK84JDN/iiAAQ/N24OGWnYGwd1B07j5b7m6/aNMDwsuH5i3BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T12:14:46.813144Z"},"content_sha256":"e309e1c1ffc82417d3c42578fa426474a75ccdb9a27690fdb60b78c44df0f75c","schema_version":"1.0","event_id":"sha256:e309e1c1ffc82417d3c42578fa426474a75ccdb9a27690fdb60b78c44df0f75c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZHTGUJ6IU7TQGF2POZLO7V6IMA/bundle.json","state_url":"https://pith.science/pith/ZHTGUJ6IU7TQGF2POZLO7V6IMA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZHTGUJ6IU7TQGF2POZLO7V6IMA/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-07-05T12:14:46Z","links":{"resolver":"https://pith.science/pith/ZHTGUJ6IU7TQGF2POZLO7V6IMA","bundle":"https://pith.science/pith/ZHTGUJ6IU7TQGF2POZLO7V6IMA/bundle.json","state":"https://pith.science/pith/ZHTGUJ6IU7TQGF2POZLO7V6IMA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZHTGUJ6IU7TQGF2POZLO7V6IMA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:ZHTGUJ6IU7TQGF2POZLO7V6IMA","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":"c61f0bb7a4ea8edabbaf49c9772c93e97f2db043238368ee20c23e361a558bfa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-05T08:38:19Z","title_canon_sha256":"eb70a55d36e7d5e38471868e1a17c0bec8bef77a446c1acc89b35b8804030e10"},"schema_version":"1.0","source":{"id":"1705.02124","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.02124","created_at":"2026-07-05T00:56:22Z"},{"alias_kind":"arxiv_version","alias_value":"1705.02124v4","created_at":"2026-07-05T00:56:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.02124","created_at":"2026-07-05T00:56:22Z"},{"alias_kind":"pith_short_12","alias_value":"ZHTGUJ6IU7TQ","created_at":"2026-07-05T00:56:22Z"},{"alias_kind":"pith_short_16","alias_value":"ZHTGUJ6IU7TQGF2P","created_at":"2026-07-05T00:56:22Z"},{"alias_kind":"pith_short_8","alias_value":"ZHTGUJ6I","created_at":"2026-07-05T00:56:22Z"}],"graph_snapshots":[{"event_id":"sha256:e309e1c1ffc82417d3c42578fa426474a75ccdb9a27690fdb60b78c44df0f75c","target":"graph","created_at":"2026-07-05T00:56:22Z","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/1705.02124/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We investigate the terminal-pairability problem in the case when the base graph is a complete bipartite graph, and the demand graph is a (not necessarily bipartite) multigraph on the same vertex set. In computer science, this problem is known as the edge-disjoint paths problem. We improve the lower bound on the maximum value of $\\Delta(D)$ which still guarantees that the demand graph $D$ has a realization in $K_{n,n}$. We also solve the extremal problem on the number of edges, i.e., we determine the maximum number of edges which guarantees that a demand graph is realizable in $K_{n,n}$.","authors_text":"Ervin Gy\\H{o}ri, Lucas Colucci, P\\'eter L. Erd\\H{o}s, Tam\\'as R\\'obert Mezei","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-05T08:38:19Z","title":"Terminal-Pairability in Complete Bipartite Graphs with Non-Bipartite Demands"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.02124","kind":"arxiv","version":4},"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:83178262e0ee64cfb9503a83fed9b82762734b6b44c5de6f2c9a1749afdb4844","target":"record","created_at":"2026-07-05T00:56:22Z","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":"c61f0bb7a4ea8edabbaf49c9772c93e97f2db043238368ee20c23e361a558bfa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-05T08:38:19Z","title_canon_sha256":"eb70a55d36e7d5e38471868e1a17c0bec8bef77a446c1acc89b35b8804030e10"},"schema_version":"1.0","source":{"id":"1705.02124","kind":"arxiv","version":4}},"canonical_sha256":"c9e66a27c8a7e703174f7656efd7c8603ff583b39ac240cb0a724eb8f0a06017","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c9e66a27c8a7e703174f7656efd7c8603ff583b39ac240cb0a724eb8f0a06017","first_computed_at":"2026-07-05T00:56:22.199970Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:56:22.199970Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2Gowm6FCyiUS3CPvJmEuV/r/k9N2fk63gVhNgt7NolznLmcurOvWh2A8Wkvt7xkGsGJZIYEpKO+K/7mDLWidCA==","signature_status":"signed_v1","signed_at":"2026-07-05T00:56:22.200446Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.02124","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:83178262e0ee64cfb9503a83fed9b82762734b6b44c5de6f2c9a1749afdb4844","sha256:e309e1c1ffc82417d3c42578fa426474a75ccdb9a27690fdb60b78c44df0f75c"],"state_sha256":"d577f43a88b0a8c353b8ab16dc3e226c6befb091c2ea270a75b53a4fe3f91f8a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FV6UcONHfs3CS1zfmVDg+vg1e/WDy0ctLzra/qnutbzbmkMPnerSmGj7ur+Yqp3ero2wS51Mn2dZpukAlb8BDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T12:14:46.815073Z","bundle_sha256":"5e8b0fe29af0e96c578ea15b88c60e39e3e2bd0d14ba72b9e8b7047321e47184"}}