{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:63NYKSKKMUEPA5TPSROKEIDK5C","short_pith_number":"pith:63NYKSKK","canonical_record":{"source":{"id":"1505.02371","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-05-10T11:36:54Z","cross_cats_sorted":["cs.DM","cs.DS"],"title_canon_sha256":"3428ec0159738cc3830a2ffe040755bd7731769ab4bf8c6c992424d1e2b6e3ad","abstract_canon_sha256":"025fafd26a8cbae45a442d68d5ae9f37e70b66b5954426d5f12f7af54f81350a"},"schema_version":"1.0"},"canonical_sha256":"f6db85494a6508f0766f945ca2206ae8bb442fda982ba6a2a2eee983c1dc014b","source":{"kind":"arxiv","id":"1505.02371","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.02371","created_at":"2026-05-18T01:17:44Z"},{"alias_kind":"arxiv_version","alias_value":"1505.02371v2","created_at":"2026-05-18T01:17:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.02371","created_at":"2026-05-18T01:17:44Z"},{"alias_kind":"pith_short_12","alias_value":"63NYKSKKMUEP","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"63NYKSKKMUEPA5TP","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"63NYKSKK","created_at":"2026-05-18T12:29:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:63NYKSKKMUEPA5TPSROKEIDK5C","target":"record","payload":{"canonical_record":{"source":{"id":"1505.02371","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-05-10T11:36:54Z","cross_cats_sorted":["cs.DM","cs.DS"],"title_canon_sha256":"3428ec0159738cc3830a2ffe040755bd7731769ab4bf8c6c992424d1e2b6e3ad","abstract_canon_sha256":"025fafd26a8cbae45a442d68d5ae9f37e70b66b5954426d5f12f7af54f81350a"},"schema_version":"1.0"},"canonical_sha256":"f6db85494a6508f0766f945ca2206ae8bb442fda982ba6a2a2eee983c1dc014b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:44.029279Z","signature_b64":"OcQNMlC7rlagW5IcPGp4+mYNmW5w0hvShZKfvpCGQNO1/IHceYyoB9bDPX4hlZXbrhiK/x8zmHonc1ujsOPxCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f6db85494a6508f0766f945ca2206ae8bb442fda982ba6a2a2eee983c1dc014b","last_reissued_at":"2026-05-18T01:17:44.028646Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:44.028646Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1505.02371","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-18T01:17:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cm/3ttX0Uk59DG/wLwReUVQk9QMjRMHJP8eh/0IOpGOoFD1bjzBkZLbu0aTMLb+Ac9TvNsiqlrnWXRDUWLIBAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T06:52:50.584560Z"},"content_sha256":"200bb6955e044e8ff83591a4c2cd6f24a6a7cf68a6634c9afef9de4f4e70a851","schema_version":"1.0","event_id":"sha256:200bb6955e044e8ff83591a4c2cd6f24a6a7cf68a6634c9afef9de4f4e70a851"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:63NYKSKKMUEPA5TPSROKEIDK5C","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Computing maximal autarkies with few and simple oracle queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS"],"primary_cat":"cs.LO","authors_text":"Joao Marques-Silva, Oliver Kullmann","submitted_at":"2015-05-10T11:36:54Z","abstract_excerpt":"We consider the algorithmic task of computing a maximal autarky for a clause-set F, i.e., a partial assignment which satisfies every clause of F it touches, and where this property is destroyed by adding any non-empty set of further assignments. We employ SAT solvers as oracles, using various capabilities. Using the standard SAT oracle, log_2(n(F)) oracle calls suffice, where n(F) is the number of variables, but the drawback is that (translated) cardinality constraints are employed, which makes this approach less efficient in practice. Using an extended SAT oracle, motivated by the capabilitie"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.02371","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-18T01:17:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zZpyq6qHbL7qq5q8OD8XqWTZdlcFLRnjCJ9JDM2ssA0ylsGaZOo+r7NcdZVXCi6cJPpmelzRsBi6f6xvR3zUCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T06:52:50.585281Z"},"content_sha256":"d4e620a0ecca13ab8b6215524b1caa955e1a484862f0e685b8e715749141dbe0","schema_version":"1.0","event_id":"sha256:d4e620a0ecca13ab8b6215524b1caa955e1a484862f0e685b8e715749141dbe0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/63NYKSKKMUEPA5TPSROKEIDK5C/bundle.json","state_url":"https://pith.science/pith/63NYKSKKMUEPA5TPSROKEIDK5C/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/63NYKSKKMUEPA5TPSROKEIDK5C/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-05-26T06:52:50Z","links":{"resolver":"https://pith.science/pith/63NYKSKKMUEPA5TPSROKEIDK5C","bundle":"https://pith.science/pith/63NYKSKKMUEPA5TPSROKEIDK5C/bundle.json","state":"https://pith.science/pith/63NYKSKKMUEPA5TPSROKEIDK5C/state.json","well_known_bundle":"https://pith.science/.well-known/pith/63NYKSKKMUEPA5TPSROKEIDK5C/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:63NYKSKKMUEPA5TPSROKEIDK5C","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":"025fafd26a8cbae45a442d68d5ae9f37e70b66b5954426d5f12f7af54f81350a","cross_cats_sorted":["cs.DM","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-05-10T11:36:54Z","title_canon_sha256":"3428ec0159738cc3830a2ffe040755bd7731769ab4bf8c6c992424d1e2b6e3ad"},"schema_version":"1.0","source":{"id":"1505.02371","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.02371","created_at":"2026-05-18T01:17:44Z"},{"alias_kind":"arxiv_version","alias_value":"1505.02371v2","created_at":"2026-05-18T01:17:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.02371","created_at":"2026-05-18T01:17:44Z"},{"alias_kind":"pith_short_12","alias_value":"63NYKSKKMUEP","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"63NYKSKKMUEPA5TP","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"63NYKSKK","created_at":"2026-05-18T12:29:07Z"}],"graph_snapshots":[{"event_id":"sha256:d4e620a0ecca13ab8b6215524b1caa955e1a484862f0e685b8e715749141dbe0","target":"graph","created_at":"2026-05-18T01:17:44Z","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":"We consider the algorithmic task of computing a maximal autarky for a clause-set F, i.e., a partial assignment which satisfies every clause of F it touches, and where this property is destroyed by adding any non-empty set of further assignments. We employ SAT solvers as oracles, using various capabilities. Using the standard SAT oracle, log_2(n(F)) oracle calls suffice, where n(F) is the number of variables, but the drawback is that (translated) cardinality constraints are employed, which makes this approach less efficient in practice. Using an extended SAT oracle, motivated by the capabilitie","authors_text":"Joao Marques-Silva, Oliver Kullmann","cross_cats":["cs.DM","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-05-10T11:36:54Z","title":"Computing maximal autarkies with few and simple oracle queries"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.02371","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:200bb6955e044e8ff83591a4c2cd6f24a6a7cf68a6634c9afef9de4f4e70a851","target":"record","created_at":"2026-05-18T01:17:44Z","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":"025fafd26a8cbae45a442d68d5ae9f37e70b66b5954426d5f12f7af54f81350a","cross_cats_sorted":["cs.DM","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-05-10T11:36:54Z","title_canon_sha256":"3428ec0159738cc3830a2ffe040755bd7731769ab4bf8c6c992424d1e2b6e3ad"},"schema_version":"1.0","source":{"id":"1505.02371","kind":"arxiv","version":2}},"canonical_sha256":"f6db85494a6508f0766f945ca2206ae8bb442fda982ba6a2a2eee983c1dc014b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f6db85494a6508f0766f945ca2206ae8bb442fda982ba6a2a2eee983c1dc014b","first_computed_at":"2026-05-18T01:17:44.028646Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:17:44.028646Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OcQNMlC7rlagW5IcPGp4+mYNmW5w0hvShZKfvpCGQNO1/IHceYyoB9bDPX4hlZXbrhiK/x8zmHonc1ujsOPxCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:17:44.029279Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.02371","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:200bb6955e044e8ff83591a4c2cd6f24a6a7cf68a6634c9afef9de4f4e70a851","sha256:d4e620a0ecca13ab8b6215524b1caa955e1a484862f0e685b8e715749141dbe0"],"state_sha256":"52641252460f2e230b80984cd476d47d5c090a4857782201b070dea3a85a7061"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7eIhOT5q/yLZzvNIxxVVl+C9ll1M8ozT1O7t0KyW5I2qAuun9siFoNJWR7yToaqyFl8aSt38lR8OngjUoFG2Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T06:52:50.589400Z","bundle_sha256":"d4f3e5f19049b1d89fd8b085fa33e3273c58ce6c749fc744872f1374f6a13384"}}