{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:AYTV65BWGRFM345HN4HZZEVZN7","short_pith_number":"pith:AYTV65BW","canonical_record":{"source":{"id":"2306.02689","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-06-05T08:29:55Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"02f6ae7995de2c17313427a3271a5837e196ae1de0ab12db21ece73f041c8413","abstract_canon_sha256":"687c94cfe2ad1ac1add792c28f06b7c4ba08f2da375a17f73c7ba3a3c33573cc"},"schema_version":"1.0"},"canonical_sha256":"06275f7436344acdf3a76f0f9c92b96fca173a2db7e938a9293861d88f8099ed","source":{"kind":"arxiv","id":"2306.02689","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2306.02689","created_at":"2026-07-05T07:40:54Z"},{"alias_kind":"arxiv_version","alias_value":"2306.02689v3","created_at":"2026-07-05T07:40:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.02689","created_at":"2026-07-05T07:40:54Z"},{"alias_kind":"pith_short_12","alias_value":"AYTV65BWGRFM","created_at":"2026-07-05T07:40:54Z"},{"alias_kind":"pith_short_16","alias_value":"AYTV65BWGRFM345H","created_at":"2026-07-05T07:40:54Z"},{"alias_kind":"pith_short_8","alias_value":"AYTV65BW","created_at":"2026-07-05T07:40:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:AYTV65BWGRFM345HN4HZZEVZN7","target":"record","payload":{"canonical_record":{"source":{"id":"2306.02689","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-06-05T08:29:55Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"02f6ae7995de2c17313427a3271a5837e196ae1de0ab12db21ece73f041c8413","abstract_canon_sha256":"687c94cfe2ad1ac1add792c28f06b7c4ba08f2da375a17f73c7ba3a3c33573cc"},"schema_version":"1.0"},"canonical_sha256":"06275f7436344acdf3a76f0f9c92b96fca173a2db7e938a9293861d88f8099ed","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:40:54.024367Z","signature_b64":"WbaO5vlnL7T5FBIVv/y41x03TxwZJZj9Uw5KovowWVOzwHL4HOCCI/kmqhDSYCwNv3cBmO4Hl8P005g8JK5mAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"06275f7436344acdf3a76f0f9c92b96fca173a2db7e938a9293861d88f8099ed","last_reissued_at":"2026-07-05T07:40:54.023931Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:40:54.023931Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2306.02689","source_version":3,"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-05T07:40:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hpv2JayepnoHx9Hu8GfCj+VQFARGP0t/WqBUvl77ihzwP+QOHray1fEqlhL8xN18rT7ZUBPcyeWhoQPmXe4xBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T23:29:53.269902Z"},"content_sha256":"56af943c40b657a07f15d4b34bc8d30fdab73397b113ce80249dadea7fccc7cc","schema_version":"1.0","event_id":"sha256:56af943c40b657a07f15d4b34bc8d30fdab73397b113ce80249dadea7fccc7cc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:AYTV65BWGRFM345HN4HZZEVZN7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Equity-Transformer: Solving NP-hard Min-Max Routing Problems as Sequential Generation with Equity Context","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Hyeonah Kim, Jinkyoo Park, Jiwoo Son, Minsu Kim, Sanghyeok Choi","submitted_at":"2023-06-05T08:29:55Z","abstract_excerpt":"Min-max routing problems aim to minimize the maximum tour length among multiple agents by having agents conduct tasks in a cooperative manner. These problems include impactful real-world applications but are known as NP-hard. Existing methods are facing challenges, particularly in large-scale problems that require the coordination of numerous agents to cover thousands of cities. This paper proposes Equity-Transformer to solve large-scale min-max routing problems. First, we employ sequential planning approach to address min-max routing problems, allowing us to harness the powerful sequence gene"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.02689","kind":"arxiv","version":3},"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/2306.02689/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-05T07:40:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RpksumZbtkbWS9Vv9OcSZYbNoz3Lp+/3tzoLN4Ix3+p8PijYbVT39uyDlxm5LB2CiDvJeK/iTcxgDgbqbqfMAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T23:29:53.270823Z"},"content_sha256":"734a3e861360e8a4d5632b50f1da8db8ddf247483d65bbc27aeaf80bfeab1047","schema_version":"1.0","event_id":"sha256:734a3e861360e8a4d5632b50f1da8db8ddf247483d65bbc27aeaf80bfeab1047"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AYTV65BWGRFM345HN4HZZEVZN7/bundle.json","state_url":"https://pith.science/pith/AYTV65BWGRFM345HN4HZZEVZN7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AYTV65BWGRFM345HN4HZZEVZN7/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-08-21T23:29:53Z","links":{"resolver":"https://pith.science/pith/AYTV65BWGRFM345HN4HZZEVZN7","bundle":"https://pith.science/pith/AYTV65BWGRFM345HN4HZZEVZN7/bundle.json","state":"https://pith.science/pith/AYTV65BWGRFM345HN4HZZEVZN7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AYTV65BWGRFM345HN4HZZEVZN7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:AYTV65BWGRFM345HN4HZZEVZN7","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":"687c94cfe2ad1ac1add792c28f06b7c4ba08f2da375a17f73c7ba3a3c33573cc","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-06-05T08:29:55Z","title_canon_sha256":"02f6ae7995de2c17313427a3271a5837e196ae1de0ab12db21ece73f041c8413"},"schema_version":"1.0","source":{"id":"2306.02689","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2306.02689","created_at":"2026-07-05T07:40:54Z"},{"alias_kind":"arxiv_version","alias_value":"2306.02689v3","created_at":"2026-07-05T07:40:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.02689","created_at":"2026-07-05T07:40:54Z"},{"alias_kind":"pith_short_12","alias_value":"AYTV65BWGRFM","created_at":"2026-07-05T07:40:54Z"},{"alias_kind":"pith_short_16","alias_value":"AYTV65BWGRFM345H","created_at":"2026-07-05T07:40:54Z"},{"alias_kind":"pith_short_8","alias_value":"AYTV65BW","created_at":"2026-07-05T07:40:54Z"}],"graph_snapshots":[{"event_id":"sha256:734a3e861360e8a4d5632b50f1da8db8ddf247483d65bbc27aeaf80bfeab1047","target":"graph","created_at":"2026-07-05T07:40:54Z","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/2306.02689/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Min-max routing problems aim to minimize the maximum tour length among multiple agents by having agents conduct tasks in a cooperative manner. These problems include impactful real-world applications but are known as NP-hard. Existing methods are facing challenges, particularly in large-scale problems that require the coordination of numerous agents to cover thousands of cities. This paper proposes Equity-Transformer to solve large-scale min-max routing problems. First, we employ sequential planning approach to address min-max routing problems, allowing us to harness the powerful sequence gene","authors_text":"Hyeonah Kim, Jinkyoo Park, Jiwoo Son, Minsu Kim, Sanghyeok Choi","cross_cats":["math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-06-05T08:29:55Z","title":"Equity-Transformer: Solving NP-hard Min-Max Routing Problems as Sequential Generation with Equity Context"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.02689","kind":"arxiv","version":3},"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:56af943c40b657a07f15d4b34bc8d30fdab73397b113ce80249dadea7fccc7cc","target":"record","created_at":"2026-07-05T07:40:54Z","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":"687c94cfe2ad1ac1add792c28f06b7c4ba08f2da375a17f73c7ba3a3c33573cc","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-06-05T08:29:55Z","title_canon_sha256":"02f6ae7995de2c17313427a3271a5837e196ae1de0ab12db21ece73f041c8413"},"schema_version":"1.0","source":{"id":"2306.02689","kind":"arxiv","version":3}},"canonical_sha256":"06275f7436344acdf3a76f0f9c92b96fca173a2db7e938a9293861d88f8099ed","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"06275f7436344acdf3a76f0f9c92b96fca173a2db7e938a9293861d88f8099ed","first_computed_at":"2026-07-05T07:40:54.023931Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:40:54.023931Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WbaO5vlnL7T5FBIVv/y41x03TxwZJZj9Uw5KovowWVOzwHL4HOCCI/kmqhDSYCwNv3cBmO4Hl8P005g8JK5mAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T07:40:54.024367Z","signed_message":"canonical_sha256_bytes"},"source_id":"2306.02689","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:56af943c40b657a07f15d4b34bc8d30fdab73397b113ce80249dadea7fccc7cc","sha256:734a3e861360e8a4d5632b50f1da8db8ddf247483d65bbc27aeaf80bfeab1047"],"state_sha256":"5431581197def4c15b0b0f5e9d943d82e5ea1efaa1ab19a0cf7f9a8111dc40ed"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pdlyAZ0esWBkmB0u3bmsqhyGV+f7nLMeCSJJ0ngdVlMCNKikuBgrwyjaPctgqfy8s+kVWeXgO/+9282+TA34Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-21T23:29:53.277567Z","bundle_sha256":"624143cc14342492d6cb4189464ce96382f11b3605493156e98b3f0128d00b4a"}}