{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:PZYLU5DOGN32L3SHC4SX37X7L5","short_pith_number":"pith:PZYLU5DO","canonical_record":{"source":{"id":"1109.2434","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-09-12T11:48:38Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"39a962f279f866f06f30b37c7ade86d8f10e73b8f4a4ae449192595d848270bc","abstract_canon_sha256":"d56e1ec11886431ba6da4c4b81c695aabfbf091a1efff73ea30cbcf86ef913a6"},"schema_version":"1.0"},"canonical_sha256":"7e70ba746e3377a5ee4717257dfeff5f496221750e45ef8d8515d17de26925f4","source":{"kind":"arxiv","id":"1109.2434","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.2434","created_at":"2026-05-18T04:13:37Z"},{"alias_kind":"arxiv_version","alias_value":"1109.2434v1","created_at":"2026-05-18T04:13:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.2434","created_at":"2026-05-18T04:13:37Z"},{"alias_kind":"pith_short_12","alias_value":"PZYLU5DOGN32","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"PZYLU5DOGN32L3SH","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"PZYLU5DO","created_at":"2026-05-18T12:26:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:PZYLU5DOGN32L3SHC4SX37X7L5","target":"record","payload":{"canonical_record":{"source":{"id":"1109.2434","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-09-12T11:48:38Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"39a962f279f866f06f30b37c7ade86d8f10e73b8f4a4ae449192595d848270bc","abstract_canon_sha256":"d56e1ec11886431ba6da4c4b81c695aabfbf091a1efff73ea30cbcf86ef913a6"},"schema_version":"1.0"},"canonical_sha256":"7e70ba746e3377a5ee4717257dfeff5f496221750e45ef8d8515d17de26925f4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:13:37.680657Z","signature_b64":"YGfYxikULp9qQnJcsg83BNZc3pfsi3ZwhHaj9vzte3g7CwB/IcQuoCgn552ChUsPk1A3QbRTTwBzzSSgssFtAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7e70ba746e3377a5ee4717257dfeff5f496221750e45ef8d8515d17de26925f4","last_reissued_at":"2026-05-18T04:13:37.680100Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:13:37.680100Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1109.2434","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:13:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9IwqxOrULSpRdCNv7ihFittUyqVNB1fZFqVEj0WsemkECiDB6mUoZJFg4yzof0hPDqW8WLxkG4wd+jvezBnMAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T16:26:23.480973Z"},"content_sha256":"5792885be96b72dd7052d6dea7d36f22bedca53dd00cebda15846e77f4484ebb","schema_version":"1.0","event_id":"sha256:5792885be96b72dd7052d6dea7d36f22bedca53dd00cebda15846e77f4484ebb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:PZYLU5DOGN32L3SHC4SX37X7L5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Expressiveness of Communication in Answer Set Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.LO","authors_text":"Dirk Vermeir, Jeroen Janssen, Kim Bauters, Martine De Cock, Steven Schockaert","submitted_at":"2011-09-12T11:48:38Z","abstract_excerpt":"Answer set programming (ASP) is a form of declarative programming that allows to succinctly formulate and efficiently solve complex problems. An intuitive extension of this formalism is communicating ASP, in which multiple ASP programs collaborate to solve the problem at hand. However, the expressiveness of communicating ASP has not been thoroughly studied. In this paper, we present a systematic study of the additional expressiveness offered by allowing ASP programs to communicate. First, we consider a simple form of communication where programs are only allowed to ask questions to each other."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.2434","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:13:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f+Gm7l5gEBZ37/cYQyyrETKW8psc3a3KRzMuwgTCahoQYm9+SiRC1eYNqzqyPIVf8tIQePkjDyjt/37i/MlQCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T16:26:23.481603Z"},"content_sha256":"cc03e29c7ed78884d18647b796cbf972d36d7f140870417b6ce21be95b7dc84c","schema_version":"1.0","event_id":"sha256:cc03e29c7ed78884d18647b796cbf972d36d7f140870417b6ce21be95b7dc84c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PZYLU5DOGN32L3SHC4SX37X7L5/bundle.json","state_url":"https://pith.science/pith/PZYLU5DOGN32L3SHC4SX37X7L5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PZYLU5DOGN32L3SHC4SX37X7L5/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-06T16:26:23Z","links":{"resolver":"https://pith.science/pith/PZYLU5DOGN32L3SHC4SX37X7L5","bundle":"https://pith.science/pith/PZYLU5DOGN32L3SHC4SX37X7L5/bundle.json","state":"https://pith.science/pith/PZYLU5DOGN32L3SHC4SX37X7L5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PZYLU5DOGN32L3SHC4SX37X7L5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:PZYLU5DOGN32L3SHC4SX37X7L5","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":"d56e1ec11886431ba6da4c4b81c695aabfbf091a1efff73ea30cbcf86ef913a6","cross_cats_sorted":["cs.PL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-09-12T11:48:38Z","title_canon_sha256":"39a962f279f866f06f30b37c7ade86d8f10e73b8f4a4ae449192595d848270bc"},"schema_version":"1.0","source":{"id":"1109.2434","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.2434","created_at":"2026-05-18T04:13:37Z"},{"alias_kind":"arxiv_version","alias_value":"1109.2434v1","created_at":"2026-05-18T04:13:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.2434","created_at":"2026-05-18T04:13:37Z"},{"alias_kind":"pith_short_12","alias_value":"PZYLU5DOGN32","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"PZYLU5DOGN32L3SH","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"PZYLU5DO","created_at":"2026-05-18T12:26:39Z"}],"graph_snapshots":[{"event_id":"sha256:cc03e29c7ed78884d18647b796cbf972d36d7f140870417b6ce21be95b7dc84c","target":"graph","created_at":"2026-05-18T04:13:37Z","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 form of declarative programming that allows to succinctly formulate and efficiently solve complex problems. An intuitive extension of this formalism is communicating ASP, in which multiple ASP programs collaborate to solve the problem at hand. However, the expressiveness of communicating ASP has not been thoroughly studied. In this paper, we present a systematic study of the additional expressiveness offered by allowing ASP programs to communicate. First, we consider a simple form of communication where programs are only allowed to ask questions to each other.","authors_text":"Dirk Vermeir, Jeroen Janssen, Kim Bauters, Martine De Cock, Steven Schockaert","cross_cats":["cs.PL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-09-12T11:48:38Z","title":"Expressiveness of Communication in Answer Set Programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.2434","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:5792885be96b72dd7052d6dea7d36f22bedca53dd00cebda15846e77f4484ebb","target":"record","created_at":"2026-05-18T04:13:37Z","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":"d56e1ec11886431ba6da4c4b81c695aabfbf091a1efff73ea30cbcf86ef913a6","cross_cats_sorted":["cs.PL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-09-12T11:48:38Z","title_canon_sha256":"39a962f279f866f06f30b37c7ade86d8f10e73b8f4a4ae449192595d848270bc"},"schema_version":"1.0","source":{"id":"1109.2434","kind":"arxiv","version":1}},"canonical_sha256":"7e70ba746e3377a5ee4717257dfeff5f496221750e45ef8d8515d17de26925f4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7e70ba746e3377a5ee4717257dfeff5f496221750e45ef8d8515d17de26925f4","first_computed_at":"2026-05-18T04:13:37.680100Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:13:37.680100Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YGfYxikULp9qQnJcsg83BNZc3pfsi3ZwhHaj9vzte3g7CwB/IcQuoCgn552ChUsPk1A3QbRTTwBzzSSgssFtAg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:13:37.680657Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.2434","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5792885be96b72dd7052d6dea7d36f22bedca53dd00cebda15846e77f4484ebb","sha256:cc03e29c7ed78884d18647b796cbf972d36d7f140870417b6ce21be95b7dc84c"],"state_sha256":"a27e0a42478cef168a05de9c5acfb308d3c690ec9000eccc90159f1dec74a438"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M+PcjF+MyiCyrWBQGihopPd7HJEt1wbRDQg7Gp0IVkQJjQYGsJ70iceTQCQb8o1E1K+gEJdJef0gchAkCIXACg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T16:26:23.484753Z","bundle_sha256":"52d7474e269f1857f8bc91be19a46ab9873be05d6397a3e5f707f416d79c4027"}}