{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:4VGFHG7BCDNXZYY4CIKABB2RJU","short_pith_number":"pith:4VGFHG7B","canonical_record":{"source":{"id":"1608.03054","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-08-10T06:04:53Z","cross_cats_sorted":[],"title_canon_sha256":"155280323f675e1a8e03f95721b25834601c724655e6c33c5fed8e4ead23dc57","abstract_canon_sha256":"4f38915bf2d0d70ac4bc944635989b7b205e1314425af31c47f5dca27a4b2f2e"},"schema_version":"1.0"},"canonical_sha256":"e54c539be110db7ce31c12140087514d0add912e312a9ce7d1b66d979ad644cf","source":{"kind":"arxiv","id":"1608.03054","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.03054","created_at":"2026-05-18T01:09:30Z"},{"alias_kind":"arxiv_version","alias_value":"1608.03054v1","created_at":"2026-05-18T01:09:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.03054","created_at":"2026-05-18T01:09:30Z"},{"alias_kind":"pith_short_12","alias_value":"4VGFHG7BCDNX","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"4VGFHG7BCDNXZYY4","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"4VGFHG7B","created_at":"2026-05-18T12:29:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:4VGFHG7BCDNXZYY4CIKABB2RJU","target":"record","payload":{"canonical_record":{"source":{"id":"1608.03054","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-08-10T06:04:53Z","cross_cats_sorted":[],"title_canon_sha256":"155280323f675e1a8e03f95721b25834601c724655e6c33c5fed8e4ead23dc57","abstract_canon_sha256":"4f38915bf2d0d70ac4bc944635989b7b205e1314425af31c47f5dca27a4b2f2e"},"schema_version":"1.0"},"canonical_sha256":"e54c539be110db7ce31c12140087514d0add912e312a9ce7d1b66d979ad644cf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:30.379753Z","signature_b64":"F8hyugKF2ksm7RVzjGD/2qQR5cO/427PihVrvejhrL0a65hEpBkFp5NNTICbe3yvORtcEQEYy+H//5PNj+7SDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e54c539be110db7ce31c12140087514d0add912e312a9ce7d1b66d979ad644cf","last_reissued_at":"2026-05-18T01:09:30.379389Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:30.379389Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.03054","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-18T01:09:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mM1efZLcccDVD16RVLyCkUvVsUV/I3IIFfTPjWV8zRRT+9R/yDjq/qZi0wpeeirr/LB/qLYJqvuHQuPyLFJhCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T15:26:48.795127Z"},"content_sha256":"4aa369fefc974051503baaed13ba6c0767034b95c7076bc9b2ae0560d0cce8de","schema_version":"1.0","event_id":"sha256:4aa369fefc974051503baaed13ba6c0767034b95c7076bc9b2ae0560d0cce8de"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:4VGFHG7BCDNXZYY4CIKABB2RJU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Completeness of Selective Unification in Concolic Testing of Logic Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Etienne Payet, Fred Mesnard, German Vidal","submitted_at":"2016-08-10T06:04:53Z","abstract_excerpt":"Concolic testing is a popular dynamic validation technique that can be used for both model checking and automatic test case generation. We have recently introduced concolic testing in the context of logic programming. In contrast to previous approaches, the key ingredient in this setting is a technique to generate appropriate run-time goals by considering all possible ways an atom can unify with the heads of some program clauses. This is called \"selective\" unification. In this paper, we show that the existing algorithm is not complete and explore different alternatives in order to have a sound"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.03054","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-18T01:09:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b7Au4uZKh6m5p326fYwz9iuh7SiDcw60AO0bIdVW89KN5Up+ZfQKGPBWswjifgusDlaT+1R5cVEF3Nbj3Q9CBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T15:26:48.795595Z"},"content_sha256":"2ae6cd609fac254e00b96810671a6a3eab9568d4f2c6eef919947cfb8f1e25b4","schema_version":"1.0","event_id":"sha256:2ae6cd609fac254e00b96810671a6a3eab9568d4f2c6eef919947cfb8f1e25b4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4VGFHG7BCDNXZYY4CIKABB2RJU/bundle.json","state_url":"https://pith.science/pith/4VGFHG7BCDNXZYY4CIKABB2RJU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4VGFHG7BCDNXZYY4CIKABB2RJU/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-28T15:26:48Z","links":{"resolver":"https://pith.science/pith/4VGFHG7BCDNXZYY4CIKABB2RJU","bundle":"https://pith.science/pith/4VGFHG7BCDNXZYY4CIKABB2RJU/bundle.json","state":"https://pith.science/pith/4VGFHG7BCDNXZYY4CIKABB2RJU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4VGFHG7BCDNXZYY4CIKABB2RJU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:4VGFHG7BCDNXZYY4CIKABB2RJU","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":"4f38915bf2d0d70ac4bc944635989b7b205e1314425af31c47f5dca27a4b2f2e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-08-10T06:04:53Z","title_canon_sha256":"155280323f675e1a8e03f95721b25834601c724655e6c33c5fed8e4ead23dc57"},"schema_version":"1.0","source":{"id":"1608.03054","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.03054","created_at":"2026-05-18T01:09:30Z"},{"alias_kind":"arxiv_version","alias_value":"1608.03054v1","created_at":"2026-05-18T01:09:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.03054","created_at":"2026-05-18T01:09:30Z"},{"alias_kind":"pith_short_12","alias_value":"4VGFHG7BCDNX","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"4VGFHG7BCDNXZYY4","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"4VGFHG7B","created_at":"2026-05-18T12:29:58Z"}],"graph_snapshots":[{"event_id":"sha256:2ae6cd609fac254e00b96810671a6a3eab9568d4f2c6eef919947cfb8f1e25b4","target":"graph","created_at":"2026-05-18T01:09:30Z","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":"Concolic testing is a popular dynamic validation technique that can be used for both model checking and automatic test case generation. We have recently introduced concolic testing in the context of logic programming. In contrast to previous approaches, the key ingredient in this setting is a technique to generate appropriate run-time goals by considering all possible ways an atom can unify with the heads of some program clauses. This is called \"selective\" unification. In this paper, we show that the existing algorithm is not complete and explore different alternatives in order to have a sound","authors_text":"Etienne Payet, Fred Mesnard, German Vidal","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-08-10T06:04:53Z","title":"On the Completeness of Selective Unification in Concolic Testing of Logic Programs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.03054","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:4aa369fefc974051503baaed13ba6c0767034b95c7076bc9b2ae0560d0cce8de","target":"record","created_at":"2026-05-18T01:09:30Z","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":"4f38915bf2d0d70ac4bc944635989b7b205e1314425af31c47f5dca27a4b2f2e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-08-10T06:04:53Z","title_canon_sha256":"155280323f675e1a8e03f95721b25834601c724655e6c33c5fed8e4ead23dc57"},"schema_version":"1.0","source":{"id":"1608.03054","kind":"arxiv","version":1}},"canonical_sha256":"e54c539be110db7ce31c12140087514d0add912e312a9ce7d1b66d979ad644cf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e54c539be110db7ce31c12140087514d0add912e312a9ce7d1b66d979ad644cf","first_computed_at":"2026-05-18T01:09:30.379389Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:09:30.379389Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"F8hyugKF2ksm7RVzjGD/2qQR5cO/427PihVrvejhrL0a65hEpBkFp5NNTICbe3yvORtcEQEYy+H//5PNj+7SDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:09:30.379753Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.03054","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4aa369fefc974051503baaed13ba6c0767034b95c7076bc9b2ae0560d0cce8de","sha256:2ae6cd609fac254e00b96810671a6a3eab9568d4f2c6eef919947cfb8f1e25b4"],"state_sha256":"f5865ac6d78df7b0b6b09401f7e412f982d0bbdcdf234c5800f4811a0c31f0c5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0zhsqtvZHAJ/lV7zUslJgjXfItH1kYBcWIUPOC4UB8EEYvLNOKE45mZgjw1sC7q4jn95Op3yE56Ihiu1GzYsAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T15:26:48.799083Z","bundle_sha256":"3037c96debd806b5f562185cf41fc8f5042d7636c7cfa7d987c39ccbc9de7db2"}}