{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:UC2KY5VG2SNZE7OOIV3YVPWNHX","short_pith_number":"pith:UC2KY5VG","canonical_record":{"source":{"id":"1108.5837","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-08-30T05:52:38Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"496a785ce6ad8662c03247c4b24aa9f61822753a5a9b62529432f0146791fcf5","abstract_canon_sha256":"b7a329edad2f94160413f859ba201334017508cfac4e56310a710c835b595230"},"schema_version":"1.0"},"canonical_sha256":"a0b4ac76a6d49b927dce45778abecd3dde5ccadc9864ab7bc5aeb5e764ee9e6c","source":{"kind":"arxiv","id":"1108.5837","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.5837","created_at":"2026-05-18T04:14:28Z"},{"alias_kind":"arxiv_version","alias_value":"1108.5837v1","created_at":"2026-05-18T04:14:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.5837","created_at":"2026-05-18T04:14:28Z"},{"alias_kind":"pith_short_12","alias_value":"UC2KY5VG2SNZ","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"UC2KY5VG2SNZE7OO","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"UC2KY5VG","created_at":"2026-05-18T12:26:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:UC2KY5VG2SNZE7OOIV3YVPWNHX","target":"record","payload":{"canonical_record":{"source":{"id":"1108.5837","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-08-30T05:52:38Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"496a785ce6ad8662c03247c4b24aa9f61822753a5a9b62529432f0146791fcf5","abstract_canon_sha256":"b7a329edad2f94160413f859ba201334017508cfac4e56310a710c835b595230"},"schema_version":"1.0"},"canonical_sha256":"a0b4ac76a6d49b927dce45778abecd3dde5ccadc9864ab7bc5aeb5e764ee9e6c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:14:28.459468Z","signature_b64":"B+MNVO1Eqzsb+NaWaLzon/3wNoGmTg1D+x5i3fKmBZzAyItnSebw5e9tzIs3F38KX7OOF2NYoqTnWv7KGVGjDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a0b4ac76a6d49b927dce45778abecd3dde5ccadc9864ab7bc5aeb5e764ee9e6c","last_reissued_at":"2026-05-18T04:14:28.458986Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:14:28.458986Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1108.5837","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:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"17Fkre9JQRmGGPQRlh/F/eYkNJoeZ2MNAX01a1EdZrRFn1YJRuNN8W0m9v2yBsQhA9EaZbE6dND5PspGhi3LCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T13:31:48.599751Z"},"content_sha256":"0f3daae3795dbea6eb58845c86b2118839d7133adf098b678bd29862a9422cdc","schema_version":"1.0","event_id":"sha256:0f3daae3795dbea6eb58845c86b2118839d7133adf098b678bd29862a9422cdc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:UC2KY5VG2SNZE7OOIV3YVPWNHX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Translating Answer-Set Programs into Bit-Vector Logic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.AI","authors_text":"Ilkka Niemel\\\"a, Mai Nguyen, Tomi Janhunen","submitted_at":"2011-08-30T05:52:38Z","abstract_excerpt":"Answer set programming (ASP) is a paradigm for declarative problem solving where problems are first formalized as rule sets, i.e., answer-set programs, in a uniform way and then solved by computing answer sets for programs. The satisfiability modulo theories (SMT) framework follows a similar modelling philosophy but the syntax is based on extensions of propositional logic rather than rules. Quite recently, a translation from answer-set programs into difference logic was provided---enabling the use of particular SMT solvers for the computation of answer sets. In this paper, the translation is r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.5837","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:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pmz1hx9kqXIeY2VftYVLkbb3+0PmV7iPhulj5NWQxkc52ICtMr/2N++PLNu25Pp8+L1D2zQFiO55hfJJ6WhJCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T13:31:48.600096Z"},"content_sha256":"9da5cbc7ab1513683606ac1e690e2dcae53cca9fd6232a8d18cc42c0f24c7428","schema_version":"1.0","event_id":"sha256:9da5cbc7ab1513683606ac1e690e2dcae53cca9fd6232a8d18cc42c0f24c7428"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UC2KY5VG2SNZE7OOIV3YVPWNHX/bundle.json","state_url":"https://pith.science/pith/UC2KY5VG2SNZE7OOIV3YVPWNHX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UC2KY5VG2SNZE7OOIV3YVPWNHX/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-28T13:31:48Z","links":{"resolver":"https://pith.science/pith/UC2KY5VG2SNZE7OOIV3YVPWNHX","bundle":"https://pith.science/pith/UC2KY5VG2SNZE7OOIV3YVPWNHX/bundle.json","state":"https://pith.science/pith/UC2KY5VG2SNZE7OOIV3YVPWNHX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UC2KY5VG2SNZE7OOIV3YVPWNHX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:UC2KY5VG2SNZE7OOIV3YVPWNHX","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":"b7a329edad2f94160413f859ba201334017508cfac4e56310a710c835b595230","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-08-30T05:52:38Z","title_canon_sha256":"496a785ce6ad8662c03247c4b24aa9f61822753a5a9b62529432f0146791fcf5"},"schema_version":"1.0","source":{"id":"1108.5837","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.5837","created_at":"2026-05-18T04:14:28Z"},{"alias_kind":"arxiv_version","alias_value":"1108.5837v1","created_at":"2026-05-18T04:14:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.5837","created_at":"2026-05-18T04:14:28Z"},{"alias_kind":"pith_short_12","alias_value":"UC2KY5VG2SNZ","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"UC2KY5VG2SNZE7OO","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"UC2KY5VG","created_at":"2026-05-18T12:26:42Z"}],"graph_snapshots":[{"event_id":"sha256:9da5cbc7ab1513683606ac1e690e2dcae53cca9fd6232a8d18cc42c0f24c7428","target":"graph","created_at":"2026-05-18T04:14:28Z","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":"Answer set programming (ASP) is a paradigm for declarative problem solving where problems are first formalized as rule sets, i.e., answer-set programs, in a uniform way and then solved by computing answer sets for programs. The satisfiability modulo theories (SMT) framework follows a similar modelling philosophy but the syntax is based on extensions of propositional logic rather than rules. Quite recently, a translation from answer-set programs into difference logic was provided---enabling the use of particular SMT solvers for the computation of answer sets. In this paper, the translation is r","authors_text":"Ilkka Niemel\\\"a, Mai Nguyen, Tomi Janhunen","cross_cats":["cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-08-30T05:52:38Z","title":"Translating Answer-Set Programs into Bit-Vector Logic"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.5837","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:0f3daae3795dbea6eb58845c86b2118839d7133adf098b678bd29862a9422cdc","target":"record","created_at":"2026-05-18T04:14:28Z","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":"b7a329edad2f94160413f859ba201334017508cfac4e56310a710c835b595230","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-08-30T05:52:38Z","title_canon_sha256":"496a785ce6ad8662c03247c4b24aa9f61822753a5a9b62529432f0146791fcf5"},"schema_version":"1.0","source":{"id":"1108.5837","kind":"arxiv","version":1}},"canonical_sha256":"a0b4ac76a6d49b927dce45778abecd3dde5ccadc9864ab7bc5aeb5e764ee9e6c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a0b4ac76a6d49b927dce45778abecd3dde5ccadc9864ab7bc5aeb5e764ee9e6c","first_computed_at":"2026-05-18T04:14:28.458986Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:14:28.458986Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"B+MNVO1Eqzsb+NaWaLzon/3wNoGmTg1D+x5i3fKmBZzAyItnSebw5e9tzIs3F38KX7OOF2NYoqTnWv7KGVGjDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:14:28.459468Z","signed_message":"canonical_sha256_bytes"},"source_id":"1108.5837","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0f3daae3795dbea6eb58845c86b2118839d7133adf098b678bd29862a9422cdc","sha256:9da5cbc7ab1513683606ac1e690e2dcae53cca9fd6232a8d18cc42c0f24c7428"],"state_sha256":"b80fe7266a1beadf7df011678bfd997ca14b0d2f99656bf542920359637c78be"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a1GPxz8n/sKCaWs86bHEfAEZBiGP16Ru/UWHsqkP2pR8f5cOhstx1BSJ3/7r8w8hFxjEa+gLlLFywW2e51TqDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T13:31:48.602092Z","bundle_sha256":"35aff5715324373c4cd68ddd89aafaa8938e9124ad287884b4358a9d197d84b7"}}