{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:HFENKCVANEKCVHY3ZFOB3WXG7I","short_pith_number":"pith:HFENKCVA","canonical_record":{"source":{"id":"1105.3454","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-05-17T19:12:32Z","cross_cats_sorted":[],"title_canon_sha256":"57512128d735d281fbfc2b93d2915a9fb8031ce421db6be7523a87b866e49713","abstract_canon_sha256":"17488d09bb0bbcfbf5eff8f71b0433bbfaff2b06c9adf0afa242e7c5ea1e684b"},"schema_version":"1.0"},"canonical_sha256":"3948d50aa069142a9f1bc95c1ddae6fa25d62bd0940f0ac0aaae25b661689f14","source":{"kind":"arxiv","id":"1105.3454","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.3454","created_at":"2026-05-18T02:21:59Z"},{"alias_kind":"arxiv_version","alias_value":"1105.3454v1","created_at":"2026-05-18T02:21:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.3454","created_at":"2026-05-18T02:21:59Z"},{"alias_kind":"pith_short_12","alias_value":"HFENKCVANEKC","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"HFENKCVANEKCVHY3","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"HFENKCVA","created_at":"2026-05-18T12:26:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:HFENKCVANEKCVHY3ZFOB3WXG7I","target":"record","payload":{"canonical_record":{"source":{"id":"1105.3454","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-05-17T19:12:32Z","cross_cats_sorted":[],"title_canon_sha256":"57512128d735d281fbfc2b93d2915a9fb8031ce421db6be7523a87b866e49713","abstract_canon_sha256":"17488d09bb0bbcfbf5eff8f71b0433bbfaff2b06c9adf0afa242e7c5ea1e684b"},"schema_version":"1.0"},"canonical_sha256":"3948d50aa069142a9f1bc95c1ddae6fa25d62bd0940f0ac0aaae25b661689f14","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:59.639036Z","signature_b64":"/TFEuMegFTfbkwVdxSpODfxgFODAGB0NfJXCUXoO+XSHHwy25V4c9mxAaie1A0mgLfiRwGnSvs1TMIfSIlppAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3948d50aa069142a9f1bc95c1ddae6fa25d62bd0940f0ac0aaae25b661689f14","last_reissued_at":"2026-05-18T02:21:59.638297Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:59.638297Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1105.3454","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:21:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8WH3YlYcQs7V0r/Ienrdh3iDRb1O6MOsMFeHBnkc9R2fVJRklcMtgai3DHV83LbfBZpRUN4+n/rxpqk1Ev31CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T21:35:10.143046Z"},"content_sha256":"d1603602ac22e3b36567516e8faf763c3469ceed614e19c97fc9d8589047bf09","schema_version":"1.0","event_id":"sha256:d1603602ac22e3b36567516e8faf763c3469ceed614e19c97fc9d8589047bf09"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:HFENKCVANEKCVHY3ZFOB3WXG7I","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Computing in the fractal cloud: modular generic solvers for SAT and Q-SAT variants","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Denys Duchier, J\\'er\\^ome Durand-Lose, Maxime Senot","submitted_at":"2011-05-17T19:12:32Z","abstract_excerpt":"Abstract geometrical computation can solve hard combinatorial problems efficiently: we showed previously how Q-SAT can be solved in bounded space and time using instance-specific signal machines and fractal parallelization. In this article, we propose an approach for constructing a particular generic machine for the same task. This machine deploies the Map/Reduce paradigm over a fractal structure. Moreover our approach is modular: the machine is constructed by combining modules. In this manner, we can easily create generic machines for solving satifiability variants, such as SAT, #SAT, MAX-SAT"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.3454","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:21:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xecve3AY2lRsxrUjXEuV4rvzhwgSNw5KuhD8IyZu2v18Xc6zYrjNdqfxNkECQ+cr69nElP2SM77be9LO2ee2AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T21:35:10.143405Z"},"content_sha256":"24e0c0675f77a7b899b9c8e416c98e5bbb2f35e689e800526edc92ca9629b479","schema_version":"1.0","event_id":"sha256:24e0c0675f77a7b899b9c8e416c98e5bbb2f35e689e800526edc92ca9629b479"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HFENKCVANEKCVHY3ZFOB3WXG7I/bundle.json","state_url":"https://pith.science/pith/HFENKCVANEKCVHY3ZFOB3WXG7I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HFENKCVANEKCVHY3ZFOB3WXG7I/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-20T21:35:10Z","links":{"resolver":"https://pith.science/pith/HFENKCVANEKCVHY3ZFOB3WXG7I","bundle":"https://pith.science/pith/HFENKCVANEKCVHY3ZFOB3WXG7I/bundle.json","state":"https://pith.science/pith/HFENKCVANEKCVHY3ZFOB3WXG7I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HFENKCVANEKCVHY3ZFOB3WXG7I/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:HFENKCVANEKCVHY3ZFOB3WXG7I","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":"17488d09bb0bbcfbf5eff8f71b0433bbfaff2b06c9adf0afa242e7c5ea1e684b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-05-17T19:12:32Z","title_canon_sha256":"57512128d735d281fbfc2b93d2915a9fb8031ce421db6be7523a87b866e49713"},"schema_version":"1.0","source":{"id":"1105.3454","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.3454","created_at":"2026-05-18T02:21:59Z"},{"alias_kind":"arxiv_version","alias_value":"1105.3454v1","created_at":"2026-05-18T02:21:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.3454","created_at":"2026-05-18T02:21:59Z"},{"alias_kind":"pith_short_12","alias_value":"HFENKCVANEKC","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"HFENKCVANEKCVHY3","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"HFENKCVA","created_at":"2026-05-18T12:26:30Z"}],"graph_snapshots":[{"event_id":"sha256:24e0c0675f77a7b899b9c8e416c98e5bbb2f35e689e800526edc92ca9629b479","target":"graph","created_at":"2026-05-18T02:21:59Z","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":"Abstract geometrical computation can solve hard combinatorial problems efficiently: we showed previously how Q-SAT can be solved in bounded space and time using instance-specific signal machines and fractal parallelization. In this article, we propose an approach for constructing a particular generic machine for the same task. This machine deploies the Map/Reduce paradigm over a fractal structure. Moreover our approach is modular: the machine is constructed by combining modules. In this manner, we can easily create generic machines for solving satifiability variants, such as SAT, #SAT, MAX-SAT","authors_text":"Denys Duchier, J\\'er\\^ome Durand-Lose, Maxime Senot","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-05-17T19:12:32Z","title":"Computing in the fractal cloud: modular generic solvers for SAT and Q-SAT variants"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.3454","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:d1603602ac22e3b36567516e8faf763c3469ceed614e19c97fc9d8589047bf09","target":"record","created_at":"2026-05-18T02:21:59Z","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":"17488d09bb0bbcfbf5eff8f71b0433bbfaff2b06c9adf0afa242e7c5ea1e684b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-05-17T19:12:32Z","title_canon_sha256":"57512128d735d281fbfc2b93d2915a9fb8031ce421db6be7523a87b866e49713"},"schema_version":"1.0","source":{"id":"1105.3454","kind":"arxiv","version":1}},"canonical_sha256":"3948d50aa069142a9f1bc95c1ddae6fa25d62bd0940f0ac0aaae25b661689f14","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3948d50aa069142a9f1bc95c1ddae6fa25d62bd0940f0ac0aaae25b661689f14","first_computed_at":"2026-05-18T02:21:59.638297Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:21:59.638297Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/TFEuMegFTfbkwVdxSpODfxgFODAGB0NfJXCUXoO+XSHHwy25V4c9mxAaie1A0mgLfiRwGnSvs1TMIfSIlppAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:21:59.639036Z","signed_message":"canonical_sha256_bytes"},"source_id":"1105.3454","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d1603602ac22e3b36567516e8faf763c3469ceed614e19c97fc9d8589047bf09","sha256:24e0c0675f77a7b899b9c8e416c98e5bbb2f35e689e800526edc92ca9629b479"],"state_sha256":"f6196f583b8d6a92fb761508ddc6e0935149c0141ba9ce84030e5ea9b7f040b2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"szvP7s1kdWnEtwdTsGlqoOi17srwmYQWBLj79cHVCWkYVdt/mY7tWrkNdh7Iag/c0TRomSmIR5wDfQx3UeXvBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T21:35:10.145368Z","bundle_sha256":"646ae0f5bccf39b42087ec4c231727e21f9ff9864a837e9bc7da8f3709abb195"}}