{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:QW3Y772TCJFBX4UYLCUMWG35SH","short_pith_number":"pith:QW3Y772T","canonical_record":{"source":{"id":"2502.00841","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-02-02T16:26:23Z","cross_cats_sorted":[],"title_canon_sha256":"87d4bed41d92f5ed9896ca1dd61b54ccebea6b09e021141d77d284313c10ea8b","abstract_canon_sha256":"01fa06af46e1d9f5620a7b86946b473659c87c052370fb90a14bba4ce1956384"},"schema_version":"1.0"},"canonical_sha256":"85b78fff53124a1bf29858a8cb1b7d91dcc7297bcaa666d99bad4c1ed4b4269e","source":{"kind":"arxiv","id":"2502.00841","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.00841","created_at":"2026-07-05T10:08:39Z"},{"alias_kind":"arxiv_version","alias_value":"2502.00841v1","created_at":"2026-07-05T10:08:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.00841","created_at":"2026-07-05T10:08:39Z"},{"alias_kind":"pith_short_12","alias_value":"QW3Y772TCJFB","created_at":"2026-07-05T10:08:39Z"},{"alias_kind":"pith_short_16","alias_value":"QW3Y772TCJFBX4UY","created_at":"2026-07-05T10:08:39Z"},{"alias_kind":"pith_short_8","alias_value":"QW3Y772T","created_at":"2026-07-05T10:08:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:QW3Y772TCJFBX4UYLCUMWG35SH","target":"record","payload":{"canonical_record":{"source":{"id":"2502.00841","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-02-02T16:26:23Z","cross_cats_sorted":[],"title_canon_sha256":"87d4bed41d92f5ed9896ca1dd61b54ccebea6b09e021141d77d284313c10ea8b","abstract_canon_sha256":"01fa06af46e1d9f5620a7b86946b473659c87c052370fb90a14bba4ce1956384"},"schema_version":"1.0"},"canonical_sha256":"85b78fff53124a1bf29858a8cb1b7d91dcc7297bcaa666d99bad4c1ed4b4269e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:08:39.110270Z","signature_b64":"KhAD94plrkfJFnirXsgTdDhQlzI0SdJRrxTAYq/ey/zmCvJCQy+nelxXdmnsSF/VacN406CTdjBaxDb7PMGqBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"85b78fff53124a1bf29858a8cb1b7d91dcc7297bcaa666d99bad4c1ed4b4269e","last_reissued_at":"2026-07-05T10:08:39.109873Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:08:39.109873Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2502.00841","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-07-05T10:08:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9+1a0+zV1UyvULxvQ6ty5ec320XyMsK7+hu/RNvBnEK6zfz7+ecsJL9tMOlNV18b/jDVSWJqoE4p4qNsRcpDDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T09:12:34.780366Z"},"content_sha256":"9a34007f928426ed3695449a3391fe656a8b81cec62fde777f675e0a51ea234c","schema_version":"1.0","event_id":"sha256:9a34007f928426ed3695449a3391fe656a8b81cec62fde777f675e0a51ea234c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:QW3Y772TCJFBX4UYLCUMWG35SH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Polynomial Time Learning-Augmented Algorithms for NP-hard Permutation Problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bruno Escoffier, Dimitris Fotakis, Evripidis Bampis, Michalis Xefteris, Panagiotis Patsilinakos","submitted_at":"2025-02-02T16:26:23Z","abstract_excerpt":"We consider a learning-augmented framework for NP-hard permutation problems. The algorithm has access to predictions telling, given a pair $u,v$ of elements, whether $u$ is before $v$ or not in an optimal solution. Building on the work of Braverman and Mossel (SODA 2008), we show that for a class of optimization problems including scheduling, network design and other graph permutation problems, these predictions allow to solve them in polynomial time with high probability, provided that predictions are true with probability at least $1/2+\\epsilon$. Moreover, this can be achieved with a parsimo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.00841","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/2502.00841/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-05T10:08:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1xtVzgDb951cXXhFbHzvVag1VsNjBXHLIOO0hlbHnCxr/qh41vB/gGTfC4mqI5Y4643yyx2eOM3su0HuhsdYAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T09:12:34.780769Z"},"content_sha256":"f6f1c1d8826604e35e5cecce8cd89ab3bcb5871ac63e003693b14a3b2cf26280","schema_version":"1.0","event_id":"sha256:f6f1c1d8826604e35e5cecce8cd89ab3bcb5871ac63e003693b14a3b2cf26280"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QW3Y772TCJFBX4UYLCUMWG35SH/bundle.json","state_url":"https://pith.science/pith/QW3Y772TCJFBX4UYLCUMWG35SH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QW3Y772TCJFBX4UYLCUMWG35SH/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-06T09:12:34Z","links":{"resolver":"https://pith.science/pith/QW3Y772TCJFBX4UYLCUMWG35SH","bundle":"https://pith.science/pith/QW3Y772TCJFBX4UYLCUMWG35SH/bundle.json","state":"https://pith.science/pith/QW3Y772TCJFBX4UYLCUMWG35SH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QW3Y772TCJFBX4UYLCUMWG35SH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:QW3Y772TCJFBX4UYLCUMWG35SH","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":"01fa06af46e1d9f5620a7b86946b473659c87c052370fb90a14bba4ce1956384","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-02-02T16:26:23Z","title_canon_sha256":"87d4bed41d92f5ed9896ca1dd61b54ccebea6b09e021141d77d284313c10ea8b"},"schema_version":"1.0","source":{"id":"2502.00841","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.00841","created_at":"2026-07-05T10:08:39Z"},{"alias_kind":"arxiv_version","alias_value":"2502.00841v1","created_at":"2026-07-05T10:08:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.00841","created_at":"2026-07-05T10:08:39Z"},{"alias_kind":"pith_short_12","alias_value":"QW3Y772TCJFB","created_at":"2026-07-05T10:08:39Z"},{"alias_kind":"pith_short_16","alias_value":"QW3Y772TCJFBX4UY","created_at":"2026-07-05T10:08:39Z"},{"alias_kind":"pith_short_8","alias_value":"QW3Y772T","created_at":"2026-07-05T10:08:39Z"}],"graph_snapshots":[{"event_id":"sha256:f6f1c1d8826604e35e5cecce8cd89ab3bcb5871ac63e003693b14a3b2cf26280","target":"graph","created_at":"2026-07-05T10:08:39Z","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/2502.00841/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider a learning-augmented framework for NP-hard permutation problems. The algorithm has access to predictions telling, given a pair $u,v$ of elements, whether $u$ is before $v$ or not in an optimal solution. Building on the work of Braverman and Mossel (SODA 2008), we show that for a class of optimization problems including scheduling, network design and other graph permutation problems, these predictions allow to solve them in polynomial time with high probability, provided that predictions are true with probability at least $1/2+\\epsilon$. Moreover, this can be achieved with a parsimo","authors_text":"Bruno Escoffier, Dimitris Fotakis, Evripidis Bampis, Michalis Xefteris, Panagiotis Patsilinakos","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-02-02T16:26:23Z","title":"Polynomial Time Learning-Augmented Algorithms for NP-hard Permutation Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.00841","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:9a34007f928426ed3695449a3391fe656a8b81cec62fde777f675e0a51ea234c","target":"record","created_at":"2026-07-05T10:08:39Z","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":"01fa06af46e1d9f5620a7b86946b473659c87c052370fb90a14bba4ce1956384","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-02-02T16:26:23Z","title_canon_sha256":"87d4bed41d92f5ed9896ca1dd61b54ccebea6b09e021141d77d284313c10ea8b"},"schema_version":"1.0","source":{"id":"2502.00841","kind":"arxiv","version":1}},"canonical_sha256":"85b78fff53124a1bf29858a8cb1b7d91dcc7297bcaa666d99bad4c1ed4b4269e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"85b78fff53124a1bf29858a8cb1b7d91dcc7297bcaa666d99bad4c1ed4b4269e","first_computed_at":"2026-07-05T10:08:39.109873Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:08:39.109873Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KhAD94plrkfJFnirXsgTdDhQlzI0SdJRrxTAYq/ey/zmCvJCQy+nelxXdmnsSF/VacN406CTdjBaxDb7PMGqBA==","signature_status":"signed_v1","signed_at":"2026-07-05T10:08:39.110270Z","signed_message":"canonical_sha256_bytes"},"source_id":"2502.00841","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9a34007f928426ed3695449a3391fe656a8b81cec62fde777f675e0a51ea234c","sha256:f6f1c1d8826604e35e5cecce8cd89ab3bcb5871ac63e003693b14a3b2cf26280"],"state_sha256":"e2733689139a14bb8cdd04f20eecf643e60f37e7fbca5d61f72bd14e3363f509"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hagSPwg5B1vwa/uVY8UVzf2S+3LmjYQVjsg22usDbzfHltMUJXT/HZZmUhOs/pYhgkPq0XVvcr6vKdlJ+JeaAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T09:12:34.785133Z","bundle_sha256":"bf9b993b731b5ba50bb6c30cf96158cfe66f35ca437d92646a2c990fc1267c55"}}