{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:CG5OKXFYR2MYFFHB7O3AF2XXFK","short_pith_number":"pith:CG5OKXFY","canonical_record":{"source":{"id":"2605.21234","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2026-05-20T14:24:07Z","cross_cats_sorted":[],"title_canon_sha256":"e0d7fc8ea995461c9369f0df6ffe37d61d690482d5b650fbcb12136527ccaa0b","abstract_canon_sha256":"8a68b9f0dae949641e974bbfb520ed18c1cfcbebeb7d0989220a4b92d0da213e"},"schema_version":"1.0"},"canonical_sha256":"11bae55cb88e998294e1fbb602eaf72a834b86fbc7c2806cdd60b6a5f7f17eb7","source":{"kind":"arxiv","id":"2605.21234","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.21234","created_at":"2026-05-21T01:05:44Z"},{"alias_kind":"arxiv_version","alias_value":"2605.21234v1","created_at":"2026-05-21T01:05:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.21234","created_at":"2026-05-21T01:05:44Z"},{"alias_kind":"pith_short_12","alias_value":"CG5OKXFYR2MY","created_at":"2026-05-21T01:05:44Z"},{"alias_kind":"pith_short_16","alias_value":"CG5OKXFYR2MYFFHB","created_at":"2026-05-21T01:05:44Z"},{"alias_kind":"pith_short_8","alias_value":"CG5OKXFY","created_at":"2026-05-21T01:05:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:CG5OKXFYR2MYFFHB7O3AF2XXFK","target":"record","payload":{"canonical_record":{"source":{"id":"2605.21234","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2026-05-20T14:24:07Z","cross_cats_sorted":[],"title_canon_sha256":"e0d7fc8ea995461c9369f0df6ffe37d61d690482d5b650fbcb12136527ccaa0b","abstract_canon_sha256":"8a68b9f0dae949641e974bbfb520ed18c1cfcbebeb7d0989220a4b92d0da213e"},"schema_version":"1.0"},"canonical_sha256":"11bae55cb88e998294e1fbb602eaf72a834b86fbc7c2806cdd60b6a5f7f17eb7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-21T01:05:44.906118Z","signature_b64":"jN1rqvvzfZUenJmE1ASAL8lt5fznkuVEGwJ9JvkvTAwKEZOGcMzuOX8gdSJXoi405zqOf/MuuYWcCVzWMBVwBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"11bae55cb88e998294e1fbb602eaf72a834b86fbc7c2806cdd60b6a5f7f17eb7","last_reissued_at":"2026-05-21T01:05:44.905521Z","signature_status":"signed_v1","first_computed_at":"2026-05-21T01:05:44.905521Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.21234","source_version":1,"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-05-21T01:05:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KxXFxnS/O85wH7zH6ihEGXeixQlMzOG3XpgUDqZs6+ZKeVPzhzhHFT8YF6KgdEJIgI+FeCeqVWvdX++YnaHODg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:53:46.085451Z"},"content_sha256":"5e13a8823e0b4e3ca229c3e18e6741ec7c0df228eea9a9b4dcc8491509602fc2","schema_version":"1.0","event_id":"sha256:5e13a8823e0b4e3ca229c3e18e6741ec7c0df228eea9a9b4dcc8491509602fc2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:CG5OKXFYR2MYFFHB7O3AF2XXFK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Team Order Problem: Maximizing the Probability of Matching Being Large Enough","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Ali Pourmiri, Grzegorz Lisowski, Haris Aziz, Jiarui Gan","submitted_at":"2026-05-20T14:24:07Z","abstract_excerpt":"We consider a matching problem, which is meaningful in team competitions, as well as in information theory, recommender systems, and assignment problems. In the competitions which we study, each competitor in a team order plays a match with the corresponding opposing player. The team that wins more matches wins. We consider a problem where the input is the graph of probabilities that a team 1 player can win against the team 2 player, and the output is the optimal ordering of team 1 players given the fixed ordering of team 2. Our central result is a polynomial-time approximation scheme (PTAS) t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.21234","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.21234/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-05-21T01:05:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f+pBPeaAKU0qPvOYE35wA+ZvlEZWEs3l2/9VABf3/p+wzdH3J6tqTVRtQ0Rlcl8BVCaC+inqBUw1VUrYhoIPBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:53:46.086184Z"},"content_sha256":"594d9130981243b362f436c647ff7a4b2f890eb004b3f48223c9479743a75070","schema_version":"1.0","event_id":"sha256:594d9130981243b362f436c647ff7a4b2f890eb004b3f48223c9479743a75070"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CG5OKXFYR2MYFFHB7O3AF2XXFK/bundle.json","state_url":"https://pith.science/pith/CG5OKXFYR2MYFFHB7O3AF2XXFK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CG5OKXFYR2MYFFHB7O3AF2XXFK/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-05-25T19:53:46Z","links":{"resolver":"https://pith.science/pith/CG5OKXFYR2MYFFHB7O3AF2XXFK","bundle":"https://pith.science/pith/CG5OKXFYR2MYFFHB7O3AF2XXFK/bundle.json","state":"https://pith.science/pith/CG5OKXFYR2MYFFHB7O3AF2XXFK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CG5OKXFYR2MYFFHB7O3AF2XXFK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:CG5OKXFYR2MYFFHB7O3AF2XXFK","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":"8a68b9f0dae949641e974bbfb520ed18c1cfcbebeb7d0989220a4b92d0da213e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2026-05-20T14:24:07Z","title_canon_sha256":"e0d7fc8ea995461c9369f0df6ffe37d61d690482d5b650fbcb12136527ccaa0b"},"schema_version":"1.0","source":{"id":"2605.21234","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.21234","created_at":"2026-05-21T01:05:44Z"},{"alias_kind":"arxiv_version","alias_value":"2605.21234v1","created_at":"2026-05-21T01:05:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.21234","created_at":"2026-05-21T01:05:44Z"},{"alias_kind":"pith_short_12","alias_value":"CG5OKXFYR2MY","created_at":"2026-05-21T01:05:44Z"},{"alias_kind":"pith_short_16","alias_value":"CG5OKXFYR2MYFFHB","created_at":"2026-05-21T01:05:44Z"},{"alias_kind":"pith_short_8","alias_value":"CG5OKXFY","created_at":"2026-05-21T01:05:44Z"}],"graph_snapshots":[{"event_id":"sha256:594d9130981243b362f436c647ff7a4b2f890eb004b3f48223c9479743a75070","target":"graph","created_at":"2026-05-21T01:05:44Z","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/2605.21234/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider a matching problem, which is meaningful in team competitions, as well as in information theory, recommender systems, and assignment problems. In the competitions which we study, each competitor in a team order plays a match with the corresponding opposing player. The team that wins more matches wins. We consider a problem where the input is the graph of probabilities that a team 1 player can win against the team 2 player, and the output is the optimal ordering of team 1 players given the fixed ordering of team 2. Our central result is a polynomial-time approximation scheme (PTAS) t","authors_text":"Ali Pourmiri, Grzegorz Lisowski, Haris Aziz, Jiarui Gan","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2026-05-20T14:24:07Z","title":"The Team Order Problem: Maximizing the Probability of Matching Being Large Enough"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.21234","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:5e13a8823e0b4e3ca229c3e18e6741ec7c0df228eea9a9b4dcc8491509602fc2","target":"record","created_at":"2026-05-21T01:05:44Z","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":"8a68b9f0dae949641e974bbfb520ed18c1cfcbebeb7d0989220a4b92d0da213e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2026-05-20T14:24:07Z","title_canon_sha256":"e0d7fc8ea995461c9369f0df6ffe37d61d690482d5b650fbcb12136527ccaa0b"},"schema_version":"1.0","source":{"id":"2605.21234","kind":"arxiv","version":1}},"canonical_sha256":"11bae55cb88e998294e1fbb602eaf72a834b86fbc7c2806cdd60b6a5f7f17eb7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"11bae55cb88e998294e1fbb602eaf72a834b86fbc7c2806cdd60b6a5f7f17eb7","first_computed_at":"2026-05-21T01:05:44.905521Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-21T01:05:44.905521Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jN1rqvvzfZUenJmE1ASAL8lt5fznkuVEGwJ9JvkvTAwKEZOGcMzuOX8gdSJXoi405zqOf/MuuYWcCVzWMBVwBw==","signature_status":"signed_v1","signed_at":"2026-05-21T01:05:44.906118Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.21234","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5e13a8823e0b4e3ca229c3e18e6741ec7c0df228eea9a9b4dcc8491509602fc2","sha256:594d9130981243b362f436c647ff7a4b2f890eb004b3f48223c9479743a75070"],"state_sha256":"e67c605111293823ea9bfae5c8a14319c4f36e9833e6434fad8bc6731dcdbac0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/c9d7/ox9ZjRb9u6yL9crY2U678lXYmLzwi0h+54sSSxJrgLGXpgfsGV/+1yNgutelVpIljOpwsw4z2uF675AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T19:53:46.090510Z","bundle_sha256":"fc02d093805ec083d292e2d2a555c8e7f600a3da00d7fcceec008a09e92e9bb8"}}