{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:VIX776J77Y6QR67W5DEO6N4RCH","short_pith_number":"pith:VIX776J7","canonical_record":{"source":{"id":"1011.2685","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2010-11-11T15:29:54Z","cross_cats_sorted":["math.LO","math.OC"],"title_canon_sha256":"3ac1f194dcdbf9aabd3297730994939ce30a6831b0286d72ca2853efd6e4de32","abstract_canon_sha256":"389d74ac00fa409c1f7ef17f3e5c4eb7186c6f5a5d69eccbad21cb179cea5a51"},"schema_version":"1.0"},"canonical_sha256":"aa2ffff93ffe3d08fbf6e8c8ef379111e27e874edaec84ecad2baaaf67c1e366","source":{"kind":"arxiv","id":"1011.2685","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.2685","created_at":"2026-05-18T02:23:36Z"},{"alias_kind":"arxiv_version","alias_value":"1011.2685v2","created_at":"2026-05-18T02:23:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.2685","created_at":"2026-05-18T02:23:36Z"},{"alias_kind":"pith_short_12","alias_value":"VIX776J77Y6Q","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"VIX776J77Y6QR67W","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"VIX776J7","created_at":"2026-05-18T12:26:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:VIX776J77Y6QR67W5DEO6N4RCH","target":"record","payload":{"canonical_record":{"source":{"id":"1011.2685","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2010-11-11T15:29:54Z","cross_cats_sorted":["math.LO","math.OC"],"title_canon_sha256":"3ac1f194dcdbf9aabd3297730994939ce30a6831b0286d72ca2853efd6e4de32","abstract_canon_sha256":"389d74ac00fa409c1f7ef17f3e5c4eb7186c6f5a5d69eccbad21cb179cea5a51"},"schema_version":"1.0"},"canonical_sha256":"aa2ffff93ffe3d08fbf6e8c8ef379111e27e874edaec84ecad2baaaf67c1e366","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:23:36.998712Z","signature_b64":"iDqXWjeTuR+u8apWltInampCr41I00a8U2tJnFcND8BqmHmFTfw34zVpq6wltbweJ7NhKgM/OXbgRTti1CnBDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aa2ffff93ffe3d08fbf6e8c8ef379111e27e874edaec84ecad2baaaf67c1e366","last_reissued_at":"2026-05-18T02:23:36.998191Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:23:36.998191Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1011.2685","source_version":2,"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-18T02:23:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/dF66sTUuDMvKDWGkO3NSWv5eDQq34RCuYUTi+C+T2e+HWhTeT1/bWZzepO23aimsjy2ne9xCXr5A0Q+3eqSAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T17:37:39.965522Z"},"content_sha256":"f1cdcd1b30cf0600adbae7c9e5691bce41bf6f05fae7184f9e4ecf9837d8bfee","schema_version":"1.0","event_id":"sha256:f1cdcd1b30cf0600adbae7c9e5691bce41bf6f05fae7184f9e4ecf9837d8bfee"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:VIX776J77Y6QR67W5DEO6N4RCH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimally Solving the MCM Problem Using Pseudo-Boolean Satisfiability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.LO","math.OC"],"primary_cat":"cs.LO","authors_text":"Jos\\'e Monteiro, Levent Aksoy, Nuno P. Lopes, Vasco Manquinho","submitted_at":"2010-11-11T15:29:54Z","abstract_excerpt":"In this report, we describe three encodings of the multiple constant multiplication (MCM) problem to pseudo-boolean satisfiability (PBS), and introduce an algorithm to solve the MCM problem optimally. To the best of our knowledge, the proposed encodings and the optimization algorithm are the first formalization of the MCM problem in a PBS manner. This report evaluates the complexity of the problem size and the performance of several PBS solvers over three encodings."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.2685","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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-18T02:23:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7bWGbFxdi+aQaJcH/Sg9q0+9fzHlRWH7H1YfR58sxXG4F3ELbPfsL/LQtjRiwoT0NCvS/OQyxfpL0B5yQRLsCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T17:37:39.966139Z"},"content_sha256":"c165d3696865fcd73d1bc62b6398939960f1004a8e0a6d16a1c530f4d3640857","schema_version":"1.0","event_id":"sha256:c165d3696865fcd73d1bc62b6398939960f1004a8e0a6d16a1c530f4d3640857"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VIX776J77Y6QR67W5DEO6N4RCH/bundle.json","state_url":"https://pith.science/pith/VIX776J77Y6QR67W5DEO6N4RCH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VIX776J77Y6QR67W5DEO6N4RCH/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-06-02T17:37:39Z","links":{"resolver":"https://pith.science/pith/VIX776J77Y6QR67W5DEO6N4RCH","bundle":"https://pith.science/pith/VIX776J77Y6QR67W5DEO6N4RCH/bundle.json","state":"https://pith.science/pith/VIX776J77Y6QR67W5DEO6N4RCH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VIX776J77Y6QR67W5DEO6N4RCH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:VIX776J77Y6QR67W5DEO6N4RCH","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":"389d74ac00fa409c1f7ef17f3e5c4eb7186c6f5a5d69eccbad21cb179cea5a51","cross_cats_sorted":["math.LO","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2010-11-11T15:29:54Z","title_canon_sha256":"3ac1f194dcdbf9aabd3297730994939ce30a6831b0286d72ca2853efd6e4de32"},"schema_version":"1.0","source":{"id":"1011.2685","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.2685","created_at":"2026-05-18T02:23:36Z"},{"alias_kind":"arxiv_version","alias_value":"1011.2685v2","created_at":"2026-05-18T02:23:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.2685","created_at":"2026-05-18T02:23:36Z"},{"alias_kind":"pith_short_12","alias_value":"VIX776J77Y6Q","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"VIX776J77Y6QR67W","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"VIX776J7","created_at":"2026-05-18T12:26:15Z"}],"graph_snapshots":[{"event_id":"sha256:c165d3696865fcd73d1bc62b6398939960f1004a8e0a6d16a1c530f4d3640857","target":"graph","created_at":"2026-05-18T02:23:36Z","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"},"paper":{"abstract_excerpt":"In this report, we describe three encodings of the multiple constant multiplication (MCM) problem to pseudo-boolean satisfiability (PBS), and introduce an algorithm to solve the MCM problem optimally. To the best of our knowledge, the proposed encodings and the optimization algorithm are the first formalization of the MCM problem in a PBS manner. This report evaluates the complexity of the problem size and the performance of several PBS solvers over three encodings.","authors_text":"Jos\\'e Monteiro, Levent Aksoy, Nuno P. Lopes, Vasco Manquinho","cross_cats":["math.LO","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2010-11-11T15:29:54Z","title":"Optimally Solving the MCM Problem Using Pseudo-Boolean Satisfiability"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.2685","kind":"arxiv","version":2},"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:f1cdcd1b30cf0600adbae7c9e5691bce41bf6f05fae7184f9e4ecf9837d8bfee","target":"record","created_at":"2026-05-18T02:23:36Z","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":"389d74ac00fa409c1f7ef17f3e5c4eb7186c6f5a5d69eccbad21cb179cea5a51","cross_cats_sorted":["math.LO","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2010-11-11T15:29:54Z","title_canon_sha256":"3ac1f194dcdbf9aabd3297730994939ce30a6831b0286d72ca2853efd6e4de32"},"schema_version":"1.0","source":{"id":"1011.2685","kind":"arxiv","version":2}},"canonical_sha256":"aa2ffff93ffe3d08fbf6e8c8ef379111e27e874edaec84ecad2baaaf67c1e366","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aa2ffff93ffe3d08fbf6e8c8ef379111e27e874edaec84ecad2baaaf67c1e366","first_computed_at":"2026-05-18T02:23:36.998191Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:23:36.998191Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iDqXWjeTuR+u8apWltInampCr41I00a8U2tJnFcND8BqmHmFTfw34zVpq6wltbweJ7NhKgM/OXbgRTti1CnBDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:23:36.998712Z","signed_message":"canonical_sha256_bytes"},"source_id":"1011.2685","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f1cdcd1b30cf0600adbae7c9e5691bce41bf6f05fae7184f9e4ecf9837d8bfee","sha256:c165d3696865fcd73d1bc62b6398939960f1004a8e0a6d16a1c530f4d3640857"],"state_sha256":"c5c359325dc821261fa86bb18b00a815206c67f23d5aa4ca1b341a8cb353a178"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dk0QEePqEZIMmNCR7Suz2Q610osvtZa2VnEWh0uQuQGQ6ckdIi39DaZLqOcxEyMDc3w4lSbwe+RF2sKJRYReAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T17:37:39.969184Z","bundle_sha256":"4d1da46c30d3f558d753ede27b87d59f6e60f6d634621ae6f7b21cfda21161b5"}}