{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:2KUMRSXNCXDHF3UN6LSK5MXBGJ","short_pith_number":"pith:2KUMRSXN","canonical_record":{"source":{"id":"1505.02408","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-05-10T16:55:42Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"d987afa8e843d98cae91f1280975322cf09e69fe6aca9d99cb713c89f5b5e69d","abstract_canon_sha256":"40affacf1415bbe83bff9bb209ff5379ea10d209c48904171d19ed43b9fb4b7a"},"schema_version":"1.0"},"canonical_sha256":"d2a8c8caed15c672ee8df2e4aeb2e1326e89fbcbcb33d583b923f1cd9bb0eb90","source":{"kind":"arxiv","id":"1505.02408","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.02408","created_at":"2026-05-18T02:16:18Z"},{"alias_kind":"arxiv_version","alias_value":"1505.02408v1","created_at":"2026-05-18T02:16:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.02408","created_at":"2026-05-18T02:16:18Z"},{"alias_kind":"pith_short_12","alias_value":"2KUMRSXNCXDH","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"2KUMRSXNCXDHF3UN","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"2KUMRSXN","created_at":"2026-05-18T12:29:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:2KUMRSXNCXDHF3UN6LSK5MXBGJ","target":"record","payload":{"canonical_record":{"source":{"id":"1505.02408","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-05-10T16:55:42Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"d987afa8e843d98cae91f1280975322cf09e69fe6aca9d99cb713c89f5b5e69d","abstract_canon_sha256":"40affacf1415bbe83bff9bb209ff5379ea10d209c48904171d19ed43b9fb4b7a"},"schema_version":"1.0"},"canonical_sha256":"d2a8c8caed15c672ee8df2e4aeb2e1326e89fbcbcb33d583b923f1cd9bb0eb90","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:16:18.865843Z","signature_b64":"9O0opWTsfVSM5mJPSOVpo1WNfGe3SU55pjAh7zSzP02XGpXa6uHmTEO+WhESAv4B1y3pkxQMnns/o8DLJEsvAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d2a8c8caed15c672ee8df2e4aeb2e1326e89fbcbcb33d583b923f1cd9bb0eb90","last_reissued_at":"2026-05-18T02:16:18.865306Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:16:18.865306Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1505.02408","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-05-18T02:16:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qaPJwSUTpeWKMrXgI0GxDpwdKfupf2QIuypK8kyucu1QwQBXo7pkLq930fO5ZAA6u6WR0R/z7jG6EZUH2fcSDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T15:57:39.590906Z"},"content_sha256":"5a482ceee71a2a6da375f17b5d7d32c4ca00892a241f75e1c3b344f1a8523bf2","schema_version":"1.0","event_id":"sha256:5a482ceee71a2a6da375f17b5d7d32c4ca00892a241f75e1c3b344f1a8523bf2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:2KUMRSXNCXDHF3UN6LSK5MXBGJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"DistMS: A Non-Portfolio Distributed Solver for Maximum Satisfiability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LO","authors_text":"In\\^es Lynce, Miguel Neves, Vasco Manquinho","submitted_at":"2015-05-10T16:55:42Z","abstract_excerpt":"The most successful parallel SAT and MaxSAT solvers follow a portfolio approach, where each thread applies a different algorithm (or the same algorithm configured differently) to solve a given problem instance. The main goal of building a portfolio is to diversify the search process being carried out by each thread. As soon as one thread finishes, the instance can be deemed solved. In this paper we present a new open source distributed solver for MaxSAT solving that addresses two issues commonly found in multicore parallel solvers, namely memory contention and scalability. Preliminary results "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.02408","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":""},"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:16:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I7sC9mRQykc732SVgZHeIx3IuUd8+Om2caETvFw8lvwnoBUnrF+Y//Vs6b3IXcc54DV0MO066qkIQ614mcLeDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T15:57:39.591250Z"},"content_sha256":"aa930529ed8ef104d511dcc5bc1154d32ed5f43f37a8a6f74ac62d6b4f1d953d","schema_version":"1.0","event_id":"sha256:aa930529ed8ef104d511dcc5bc1154d32ed5f43f37a8a6f74ac62d6b4f1d953d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2KUMRSXNCXDHF3UN6LSK5MXBGJ/bundle.json","state_url":"https://pith.science/pith/2KUMRSXNCXDHF3UN6LSK5MXBGJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2KUMRSXNCXDHF3UN6LSK5MXBGJ/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-02T15:57:39Z","links":{"resolver":"https://pith.science/pith/2KUMRSXNCXDHF3UN6LSK5MXBGJ","bundle":"https://pith.science/pith/2KUMRSXNCXDHF3UN6LSK5MXBGJ/bundle.json","state":"https://pith.science/pith/2KUMRSXNCXDHF3UN6LSK5MXBGJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2KUMRSXNCXDHF3UN6LSK5MXBGJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:2KUMRSXNCXDHF3UN6LSK5MXBGJ","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":"40affacf1415bbe83bff9bb209ff5379ea10d209c48904171d19ed43b9fb4b7a","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-05-10T16:55:42Z","title_canon_sha256":"d987afa8e843d98cae91f1280975322cf09e69fe6aca9d99cb713c89f5b5e69d"},"schema_version":"1.0","source":{"id":"1505.02408","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.02408","created_at":"2026-05-18T02:16:18Z"},{"alias_kind":"arxiv_version","alias_value":"1505.02408v1","created_at":"2026-05-18T02:16:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.02408","created_at":"2026-05-18T02:16:18Z"},{"alias_kind":"pith_short_12","alias_value":"2KUMRSXNCXDH","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"2KUMRSXNCXDHF3UN","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"2KUMRSXN","created_at":"2026-05-18T12:29:02Z"}],"graph_snapshots":[{"event_id":"sha256:aa930529ed8ef104d511dcc5bc1154d32ed5f43f37a8a6f74ac62d6b4f1d953d","target":"graph","created_at":"2026-05-18T02:16:18Z","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":"The most successful parallel SAT and MaxSAT solvers follow a portfolio approach, where each thread applies a different algorithm (or the same algorithm configured differently) to solve a given problem instance. The main goal of building a portfolio is to diversify the search process being carried out by each thread. As soon as one thread finishes, the instance can be deemed solved. In this paper we present a new open source distributed solver for MaxSAT solving that addresses two issues commonly found in multicore parallel solvers, namely memory contention and scalability. Preliminary results ","authors_text":"In\\^es Lynce, Miguel Neves, Vasco Manquinho","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-05-10T16:55:42Z","title":"DistMS: A Non-Portfolio Distributed Solver for Maximum Satisfiability"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.02408","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:5a482ceee71a2a6da375f17b5d7d32c4ca00892a241f75e1c3b344f1a8523bf2","target":"record","created_at":"2026-05-18T02:16:18Z","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":"40affacf1415bbe83bff9bb209ff5379ea10d209c48904171d19ed43b9fb4b7a","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-05-10T16:55:42Z","title_canon_sha256":"d987afa8e843d98cae91f1280975322cf09e69fe6aca9d99cb713c89f5b5e69d"},"schema_version":"1.0","source":{"id":"1505.02408","kind":"arxiv","version":1}},"canonical_sha256":"d2a8c8caed15c672ee8df2e4aeb2e1326e89fbcbcb33d583b923f1cd9bb0eb90","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d2a8c8caed15c672ee8df2e4aeb2e1326e89fbcbcb33d583b923f1cd9bb0eb90","first_computed_at":"2026-05-18T02:16:18.865306Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:16:18.865306Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9O0opWTsfVSM5mJPSOVpo1WNfGe3SU55pjAh7zSzP02XGpXa6uHmTEO+WhESAv4B1y3pkxQMnns/o8DLJEsvAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:16:18.865843Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.02408","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5a482ceee71a2a6da375f17b5d7d32c4ca00892a241f75e1c3b344f1a8523bf2","sha256:aa930529ed8ef104d511dcc5bc1154d32ed5f43f37a8a6f74ac62d6b4f1d953d"],"state_sha256":"5836cd80a554ed96ba451c20e3d4acab5124895f4fba5c96db51b432411495e9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cAK5bTnlQTrOk2Mhy/xR9R0fjWHr85NAhwJgdTlfkrglPxDXYgQO+i+WrPhHJ86JJ/O7AA0wequw5EENEbl3Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T15:57:39.593344Z","bundle_sha256":"4c87940225d60996e400ff1816f515c6f00a3b4a336f67f556735b4c0b7315d9"}}