{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:EFUYQPTJNXLPKEK6NTNYM4F546","short_pith_number":"pith:EFUYQPTJ","canonical_record":{"source":{"id":"1109.0583","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-09-03T01:40:20Z","cross_cats_sorted":[],"title_canon_sha256":"4b43000ff58f0ef1f670db2d1e6fd80fe69a198cd82d58cf73e4959436626d4f","abstract_canon_sha256":"713d28a73cbb14c0dabd3319350b4cb5acc694b204ea8080d2eb0951323556fe"},"schema_version":"1.0"},"canonical_sha256":"2169883e696dd6f5115e6cdb8670bde7b9d1d7b03b1bebb195f18f52a34e347b","source":{"kind":"arxiv","id":"1109.0583","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.0583","created_at":"2026-05-18T04:14:07Z"},{"alias_kind":"arxiv_version","alias_value":"1109.0583v1","created_at":"2026-05-18T04:14:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.0583","created_at":"2026-05-18T04:14:07Z"},{"alias_kind":"pith_short_12","alias_value":"EFUYQPTJNXLP","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"EFUYQPTJNXLPKEK6","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"EFUYQPTJ","created_at":"2026-05-18T12:26:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:EFUYQPTJNXLPKEK6NTNYM4F546","target":"record","payload":{"canonical_record":{"source":{"id":"1109.0583","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-09-03T01:40:20Z","cross_cats_sorted":[],"title_canon_sha256":"4b43000ff58f0ef1f670db2d1e6fd80fe69a198cd82d58cf73e4959436626d4f","abstract_canon_sha256":"713d28a73cbb14c0dabd3319350b4cb5acc694b204ea8080d2eb0951323556fe"},"schema_version":"1.0"},"canonical_sha256":"2169883e696dd6f5115e6cdb8670bde7b9d1d7b03b1bebb195f18f52a34e347b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:14:07.280208Z","signature_b64":"Co3k0KMBClbtPvgiylUeQNL7KFgyBFmQGUyd5EnFXn3poeICnghoJnwzHH2ngaDVupjx55RiEJ5vZDTJHMacDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2169883e696dd6f5115e6cdb8670bde7b9d1d7b03b1bebb195f18f52a34e347b","last_reissued_at":"2026-05-18T04:14:07.279614Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:14:07.279614Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1109.0583","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-18T04:14:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dlBkdn0fZcjrTkntoicg/N4lVv5Zwm/Nv9RoGiRBoPZ1Ewkt4wmgqogIwptgLvdbZle3tI2veZpVjLbZp8xIBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T22:15:02.245938Z"},"content_sha256":"7290074905f3f7ce239b9cabd8dd4f664a37b8933b67f0e758791ff145087b3c","schema_version":"1.0","event_id":"sha256:7290074905f3f7ce239b9cabd8dd4f664a37b8933b67f0e758791ff145087b3c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:EFUYQPTJNXLPKEK6NTNYM4F546","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Solving Modular Model Expansion Tasks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Eugenia Ternovska, Shahab Tasharrofi, Xiongnan (Newman) Wu","submitted_at":"2011-09-03T01:40:20Z","abstract_excerpt":"The work we describe here is a part of a research program of developing foundations of declarative solving of search problems. We consider the model expansion task as the task representing the essence of search problems where we are given an instance of a problem and are searching for a solution satisfying certain properties. Such tasks are common in artificial intelligence, formal verification, computational biology. Recently, the model expansion framework was extended to deal with multiple modules. In the current paper, inspired by practical combined solvers, we introduce an algorithm to sol"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.0583","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-18T04:14:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pvFCLD013mjj7ahjK3Pz+cNqw/nla5Ti4h0U/R39geDWnibzdB4zQMFuiQBPBJ0FPgr7UgKx+1PrEr06JtjPAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T22:15:02.247033Z"},"content_sha256":"59afbfa3e0432c1bd9d7fb20b4ba24af26239ce88fa97154dfe7fcc73e385dce","schema_version":"1.0","event_id":"sha256:59afbfa3e0432c1bd9d7fb20b4ba24af26239ce88fa97154dfe7fcc73e385dce"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EFUYQPTJNXLPKEK6NTNYM4F546/bundle.json","state_url":"https://pith.science/pith/EFUYQPTJNXLPKEK6NTNYM4F546/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EFUYQPTJNXLPKEK6NTNYM4F546/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-30T22:15:02Z","links":{"resolver":"https://pith.science/pith/EFUYQPTJNXLPKEK6NTNYM4F546","bundle":"https://pith.science/pith/EFUYQPTJNXLPKEK6NTNYM4F546/bundle.json","state":"https://pith.science/pith/EFUYQPTJNXLPKEK6NTNYM4F546/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EFUYQPTJNXLPKEK6NTNYM4F546/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:EFUYQPTJNXLPKEK6NTNYM4F546","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":"713d28a73cbb14c0dabd3319350b4cb5acc694b204ea8080d2eb0951323556fe","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-09-03T01:40:20Z","title_canon_sha256":"4b43000ff58f0ef1f670db2d1e6fd80fe69a198cd82d58cf73e4959436626d4f"},"schema_version":"1.0","source":{"id":"1109.0583","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.0583","created_at":"2026-05-18T04:14:07Z"},{"alias_kind":"arxiv_version","alias_value":"1109.0583v1","created_at":"2026-05-18T04:14:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.0583","created_at":"2026-05-18T04:14:07Z"},{"alias_kind":"pith_short_12","alias_value":"EFUYQPTJNXLP","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"EFUYQPTJNXLPKEK6","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"EFUYQPTJ","created_at":"2026-05-18T12:26:28Z"}],"graph_snapshots":[{"event_id":"sha256:59afbfa3e0432c1bd9d7fb20b4ba24af26239ce88fa97154dfe7fcc73e385dce","target":"graph","created_at":"2026-05-18T04:14:07Z","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 work we describe here is a part of a research program of developing foundations of declarative solving of search problems. We consider the model expansion task as the task representing the essence of search problems where we are given an instance of a problem and are searching for a solution satisfying certain properties. Such tasks are common in artificial intelligence, formal verification, computational biology. Recently, the model expansion framework was extended to deal with multiple modules. In the current paper, inspired by practical combined solvers, we introduce an algorithm to sol","authors_text":"Eugenia Ternovska, Shahab Tasharrofi, Xiongnan (Newman) Wu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-09-03T01:40:20Z","title":"Solving Modular Model Expansion Tasks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.0583","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:7290074905f3f7ce239b9cabd8dd4f664a37b8933b67f0e758791ff145087b3c","target":"record","created_at":"2026-05-18T04:14:07Z","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":"713d28a73cbb14c0dabd3319350b4cb5acc694b204ea8080d2eb0951323556fe","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-09-03T01:40:20Z","title_canon_sha256":"4b43000ff58f0ef1f670db2d1e6fd80fe69a198cd82d58cf73e4959436626d4f"},"schema_version":"1.0","source":{"id":"1109.0583","kind":"arxiv","version":1}},"canonical_sha256":"2169883e696dd6f5115e6cdb8670bde7b9d1d7b03b1bebb195f18f52a34e347b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2169883e696dd6f5115e6cdb8670bde7b9d1d7b03b1bebb195f18f52a34e347b","first_computed_at":"2026-05-18T04:14:07.279614Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:14:07.279614Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Co3k0KMBClbtPvgiylUeQNL7KFgyBFmQGUyd5EnFXn3poeICnghoJnwzHH2ngaDVupjx55RiEJ5vZDTJHMacDg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:14:07.280208Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.0583","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7290074905f3f7ce239b9cabd8dd4f664a37b8933b67f0e758791ff145087b3c","sha256:59afbfa3e0432c1bd9d7fb20b4ba24af26239ce88fa97154dfe7fcc73e385dce"],"state_sha256":"1306d75fc4b76fe131fba8f47ef3999c93110fdd22e79f326c6fe164e8e4a6e3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SEsp1fCU90sRMW8CJRWUsXJtjFd0KuM6sTBXAVqkbFjPr6pUy83pY49I5VzUcodLSviINJZuJ6s7VzKn7ecQBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T22:15:02.250534Z","bundle_sha256":"55778b8bbfd96fe0bdf72c80f356a8776d822a44ac4c339b55dc9cf39c6abae7"}}