{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:YRAV3ERS6WDPDGDMDKGCR6WCR3","short_pith_number":"pith:YRAV3ERS","canonical_record":{"source":{"id":"2501.13463","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2025-01-23T08:26:18Z","cross_cats_sorted":[],"title_canon_sha256":"3c595358a32e0632b3f478072e80b665a07662cb9bd758524ce5807be47647ac","abstract_canon_sha256":"5be6a2fe22cb4208f89a50c35761c98d5097ad6d61c27756e0beca50a80320c3"},"schema_version":"1.0"},"canonical_sha256":"c4415d9232f586f1986c1a8c28fac28ec94b322f5e4a49df40bd3cb18968588a","source":{"kind":"arxiv","id":"2501.13463","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.13463","created_at":"2026-07-05T10:04:28Z"},{"alias_kind":"arxiv_version","alias_value":"2501.13463v1","created_at":"2026-07-05T10:04:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.13463","created_at":"2026-07-05T10:04:28Z"},{"alias_kind":"pith_short_12","alias_value":"YRAV3ERS6WDP","created_at":"2026-07-05T10:04:28Z"},{"alias_kind":"pith_short_16","alias_value":"YRAV3ERS6WDPDGDM","created_at":"2026-07-05T10:04:28Z"},{"alias_kind":"pith_short_8","alias_value":"YRAV3ERS","created_at":"2026-07-05T10:04:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:YRAV3ERS6WDPDGDMDKGCR6WCR3","target":"record","payload":{"canonical_record":{"source":{"id":"2501.13463","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2025-01-23T08:26:18Z","cross_cats_sorted":[],"title_canon_sha256":"3c595358a32e0632b3f478072e80b665a07662cb9bd758524ce5807be47647ac","abstract_canon_sha256":"5be6a2fe22cb4208f89a50c35761c98d5097ad6d61c27756e0beca50a80320c3"},"schema_version":"1.0"},"canonical_sha256":"c4415d9232f586f1986c1a8c28fac28ec94b322f5e4a49df40bd3cb18968588a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:04:28.929522Z","signature_b64":"ajwgoBgBG7+0UdSCGjkHDitq7kin04z1gnp/NaOyRNqtlzEfR+0wndNp3NTMuZDiNRUQuBwZfmU8hK3Mcg4xBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c4415d9232f586f1986c1a8c28fac28ec94b322f5e4a49df40bd3cb18968588a","last_reissued_at":"2026-07-05T10:04:28.928945Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:04:28.928945Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2501.13463","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:04:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"meDuymwYalPon+eLgR1+t1CidjtvT9HAsFOXiPO9NDLGOGa9IWGLin+YdsyzKrgb8EyEZexFYjiSd6GSlHc0Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T20:51:37.663684Z"},"content_sha256":"1931e8c25c1ccb414849891752af49ddd543920acc922bc686d326052d4a04e9","schema_version":"1.0","event_id":"sha256:1931e8c25c1ccb414849891752af49ddd543920acc922bc686d326052d4a04e9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:YRAV3ERS6WDPDGDMDKGCR6WCR3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Atomic Column Generation For Consensus Between Algorithms: Application to Path Computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"J\\'er\\'emie Leguay, Pierre Bauguion, S\\'ebastien Martin, Youcef Magnouche","submitted_at":"2025-01-23T08:26:18Z","abstract_excerpt":"In real-life applications, most optimization problems are variants of well-known combinatorial optimization problems, including additional constraints to fit with a particular use case. Usually, efficient algorithms to handle a restricted subset of these additional constraints already exist, or can be easily derived, but combining them together is difficult. The goal of our paper is to provide a framework that allows merging several so-called atomic algorithms to solve an optimization problem including all associated additional constraints together. The core proposal, referred to as Atomic Col"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.13463","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/2501.13463/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:04:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K5bLNJM4QK16LZ9NF047/U1zpXIDIdywtgCEXeIJ8MwQeQ65sRP9fxZaIvqTZmgT8tOhH8jumxYmKBtuIrdkCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T20:51:37.664178Z"},"content_sha256":"79e6f0b4ecb12095b4cc7f3481b23f9e8c7e9d527f89a2357b7d4f46f4ba93c5","schema_version":"1.0","event_id":"sha256:79e6f0b4ecb12095b4cc7f3481b23f9e8c7e9d527f89a2357b7d4f46f4ba93c5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YRAV3ERS6WDPDGDMDKGCR6WCR3/bundle.json","state_url":"https://pith.science/pith/YRAV3ERS6WDPDGDMDKGCR6WCR3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YRAV3ERS6WDPDGDMDKGCR6WCR3/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-18T20:51:37Z","links":{"resolver":"https://pith.science/pith/YRAV3ERS6WDPDGDMDKGCR6WCR3","bundle":"https://pith.science/pith/YRAV3ERS6WDPDGDMDKGCR6WCR3/bundle.json","state":"https://pith.science/pith/YRAV3ERS6WDPDGDMDKGCR6WCR3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YRAV3ERS6WDPDGDMDKGCR6WCR3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:YRAV3ERS6WDPDGDMDKGCR6WCR3","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":"5be6a2fe22cb4208f89a50c35761c98d5097ad6d61c27756e0beca50a80320c3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2025-01-23T08:26:18Z","title_canon_sha256":"3c595358a32e0632b3f478072e80b665a07662cb9bd758524ce5807be47647ac"},"schema_version":"1.0","source":{"id":"2501.13463","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.13463","created_at":"2026-07-05T10:04:28Z"},{"alias_kind":"arxiv_version","alias_value":"2501.13463v1","created_at":"2026-07-05T10:04:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.13463","created_at":"2026-07-05T10:04:28Z"},{"alias_kind":"pith_short_12","alias_value":"YRAV3ERS6WDP","created_at":"2026-07-05T10:04:28Z"},{"alias_kind":"pith_short_16","alias_value":"YRAV3ERS6WDPDGDM","created_at":"2026-07-05T10:04:28Z"},{"alias_kind":"pith_short_8","alias_value":"YRAV3ERS","created_at":"2026-07-05T10:04:28Z"}],"graph_snapshots":[{"event_id":"sha256:79e6f0b4ecb12095b4cc7f3481b23f9e8c7e9d527f89a2357b7d4f46f4ba93c5","target":"graph","created_at":"2026-07-05T10:04:28Z","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/2501.13463/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In real-life applications, most optimization problems are variants of well-known combinatorial optimization problems, including additional constraints to fit with a particular use case. Usually, efficient algorithms to handle a restricted subset of these additional constraints already exist, or can be easily derived, but combining them together is difficult. The goal of our paper is to provide a framework that allows merging several so-called atomic algorithms to solve an optimization problem including all associated additional constraints together. The core proposal, referred to as Atomic Col","authors_text":"J\\'er\\'emie Leguay, Pierre Bauguion, S\\'ebastien Martin, Youcef Magnouche","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2025-01-23T08:26:18Z","title":"Atomic Column Generation For Consensus Between Algorithms: Application to Path Computation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.13463","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:1931e8c25c1ccb414849891752af49ddd543920acc922bc686d326052d4a04e9","target":"record","created_at":"2026-07-05T10:04:28Z","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":"5be6a2fe22cb4208f89a50c35761c98d5097ad6d61c27756e0beca50a80320c3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2025-01-23T08:26:18Z","title_canon_sha256":"3c595358a32e0632b3f478072e80b665a07662cb9bd758524ce5807be47647ac"},"schema_version":"1.0","source":{"id":"2501.13463","kind":"arxiv","version":1}},"canonical_sha256":"c4415d9232f586f1986c1a8c28fac28ec94b322f5e4a49df40bd3cb18968588a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c4415d9232f586f1986c1a8c28fac28ec94b322f5e4a49df40bd3cb18968588a","first_computed_at":"2026-07-05T10:04:28.928945Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:04:28.928945Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ajwgoBgBG7+0UdSCGjkHDitq7kin04z1gnp/NaOyRNqtlzEfR+0wndNp3NTMuZDiNRUQuBwZfmU8hK3Mcg4xBA==","signature_status":"signed_v1","signed_at":"2026-07-05T10:04:28.929522Z","signed_message":"canonical_sha256_bytes"},"source_id":"2501.13463","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1931e8c25c1ccb414849891752af49ddd543920acc922bc686d326052d4a04e9","sha256:79e6f0b4ecb12095b4cc7f3481b23f9e8c7e9d527f89a2357b7d4f46f4ba93c5"],"state_sha256":"5f5e976c2342df69c70c2fadbaf36770df7c1b46f025fa4ea3fcf96dc5644197"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MYJUbXAB2MX4MTKLuFZjkkaMaBE/8aDOlsQs95H1crxMuHFiGvOT3ikp6phTRL7F6bP4cH2ZBXKtRgisZpe9AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T20:51:37.669158Z","bundle_sha256":"733ec76ea7a30671bc8fd62a58ad35340b6a46c996e5072ac767225c88ba35f0"}}