{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:YRAV3ERS6WDPDGDMDKGCR6WCR3","short_pith_number":"pith:YRAV3ERS","schema_version":"1.0","canonical_sha256":"c4415d9232f586f1986c1a8c28fac28ec94b322f5e4a49df40bd3cb18968588a","source":{"kind":"arxiv","id":"2501.13463","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2501.13463","created_at":"2026-07-05T10:04:28.929025+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.13463v1","created_at":"2026-07-05T10:04:28.929025+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.13463","created_at":"2026-07-05T10:04:28.929025+00:00"},{"alias_kind":"pith_short_12","alias_value":"YRAV3ERS6WDP","created_at":"2026-07-05T10:04:28.929025+00:00"},{"alias_kind":"pith_short_16","alias_value":"YRAV3ERS6WDPDGDM","created_at":"2026-07-05T10:04:28.929025+00:00"},{"alias_kind":"pith_short_8","alias_value":"YRAV3ERS","created_at":"2026-07-05T10:04:28.929025+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YRAV3ERS6WDPDGDMDKGCR6WCR3","json":"https://pith.science/pith/YRAV3ERS6WDPDGDMDKGCR6WCR3.json","graph_json":"https://pith.science/api/pith-number/YRAV3ERS6WDPDGDMDKGCR6WCR3/graph.json","events_json":"https://pith.science/api/pith-number/YRAV3ERS6WDPDGDMDKGCR6WCR3/events.json","paper":"https://pith.science/paper/YRAV3ERS"},"agent_actions":{"view_html":"https://pith.science/pith/YRAV3ERS6WDPDGDMDKGCR6WCR3","download_json":"https://pith.science/pith/YRAV3ERS6WDPDGDMDKGCR6WCR3.json","view_paper":"https://pith.science/paper/YRAV3ERS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.13463&json=true","fetch_graph":"https://pith.science/api/pith-number/YRAV3ERS6WDPDGDMDKGCR6WCR3/graph.json","fetch_events":"https://pith.science/api/pith-number/YRAV3ERS6WDPDGDMDKGCR6WCR3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YRAV3ERS6WDPDGDMDKGCR6WCR3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YRAV3ERS6WDPDGDMDKGCR6WCR3/action/storage_attestation","attest_author":"https://pith.science/pith/YRAV3ERS6WDPDGDMDKGCR6WCR3/action/author_attestation","sign_citation":"https://pith.science/pith/YRAV3ERS6WDPDGDMDKGCR6WCR3/action/citation_signature","submit_replication":"https://pith.science/pith/YRAV3ERS6WDPDGDMDKGCR6WCR3/action/replication_record"}},"created_at":"2026-07-05T10:04:28.929025+00:00","updated_at":"2026-07-05T10:04:28.929025+00:00"}