{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:H6KX4GHI4OANQRUV7EKISOHLI3","short_pith_number":"pith:H6KX4GHI","canonical_record":{"source":{"id":"1210.1665","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2012-10-05T07:38:35Z","cross_cats_sorted":["cs.SE"],"title_canon_sha256":"704e8a8b21e9517c444f0a7315c013e1cd01d0e94038d0907d5318a5dbbba0b3","abstract_canon_sha256":"f2ce26f817d21cb969d29296bed168a3f1cbfb507581eb900739948ea20c02de"},"schema_version":"1.0"},"canonical_sha256":"3f957e18e8e380d84695f9148938eb46fffb810291a2057371698717ee80f345","source":{"kind":"arxiv","id":"1210.1665","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.1665","created_at":"2026-05-18T03:43:53Z"},{"alias_kind":"arxiv_version","alias_value":"1210.1665v1","created_at":"2026-05-18T03:43:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.1665","created_at":"2026-05-18T03:43:53Z"},{"alias_kind":"pith_short_12","alias_value":"H6KX4GHI4OAN","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"H6KX4GHI4OANQRUV","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"H6KX4GHI","created_at":"2026-05-18T12:27:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:H6KX4GHI4OANQRUV7EKISOHLI3","target":"record","payload":{"canonical_record":{"source":{"id":"1210.1665","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2012-10-05T07:38:35Z","cross_cats_sorted":["cs.SE"],"title_canon_sha256":"704e8a8b21e9517c444f0a7315c013e1cd01d0e94038d0907d5318a5dbbba0b3","abstract_canon_sha256":"f2ce26f817d21cb969d29296bed168a3f1cbfb507581eb900739948ea20c02de"},"schema_version":"1.0"},"canonical_sha256":"3f957e18e8e380d84695f9148938eb46fffb810291a2057371698717ee80f345","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:43:53.661214Z","signature_b64":"pM9be+v1T3UH3EjZajQsthTJoQDuyunUkPSv9GoT3xl01f1zpDsV4qYNhEMTZ2cHB38CAOA45384iBgKsVXNDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3f957e18e8e380d84695f9148938eb46fffb810291a2057371698717ee80f345","last_reissued_at":"2026-05-18T03:43:53.660646Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:43:53.660646Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1210.1665","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-18T03:43:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Nq8yvf7YDXNS1tR5UjOzxdmW/7zkAxs4Cf7dh0DLgvl6KzXMhrrpmVVyFTWIfOfVasPfEaqOkf2vMn1aphl8Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T20:51:31.225029Z"},"content_sha256":"c7b724fc4bb294c229e24260f0e108ffd59db439da3069f6899e724e0e8d69b6","schema_version":"1.0","event_id":"sha256:c7b724fc4bb294c229e24260f0e108ffd59db439da3069f6899e724e0e8d69b6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:H6KX4GHI4OANQRUV7EKISOHLI3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Annotation of Logic Programs for Independent AND-Parallelism by Partial Evaluation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SE"],"primary_cat":"cs.PL","authors_text":"Germ\\'an Vidal","submitted_at":"2012-10-05T07:38:35Z","abstract_excerpt":"Traditional approaches to automatic AND-parallelization of logic programs rely on some static analysis to identify independent goals that can be safely and efficiently run in parallel in any possible execution. In this paper, we present a novel technique for generating annotations for independent AND-parallelism that is based on partial evaluation. Basically, we augment a simple partial evaluation procedure with (run-time) groundness and variable sharing information so that parallel conjunctions are added to the residual clauses when the conditions for independence are met. In contrast to prev"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.1665","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-18T03:43:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CsOCVFyGn7hIrdmu6c9IXXWWKnzIueWL36Va4CptYnXzSRBvxEJ1BrecgMtgaJg/c2IkpjMa6f16wxnSiiQHDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T20:51:31.225392Z"},"content_sha256":"8d2aa3e2e3dd502c9d5488f4cda1b06aef8dbca39cf8c3d47b452e0d67c86b18","schema_version":"1.0","event_id":"sha256:8d2aa3e2e3dd502c9d5488f4cda1b06aef8dbca39cf8c3d47b452e0d67c86b18"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/H6KX4GHI4OANQRUV7EKISOHLI3/bundle.json","state_url":"https://pith.science/pith/H6KX4GHI4OANQRUV7EKISOHLI3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/H6KX4GHI4OANQRUV7EKISOHLI3/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-01T20:51:31Z","links":{"resolver":"https://pith.science/pith/H6KX4GHI4OANQRUV7EKISOHLI3","bundle":"https://pith.science/pith/H6KX4GHI4OANQRUV7EKISOHLI3/bundle.json","state":"https://pith.science/pith/H6KX4GHI4OANQRUV7EKISOHLI3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/H6KX4GHI4OANQRUV7EKISOHLI3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:H6KX4GHI4OANQRUV7EKISOHLI3","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":"f2ce26f817d21cb969d29296bed168a3f1cbfb507581eb900739948ea20c02de","cross_cats_sorted":["cs.SE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2012-10-05T07:38:35Z","title_canon_sha256":"704e8a8b21e9517c444f0a7315c013e1cd01d0e94038d0907d5318a5dbbba0b3"},"schema_version":"1.0","source":{"id":"1210.1665","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.1665","created_at":"2026-05-18T03:43:53Z"},{"alias_kind":"arxiv_version","alias_value":"1210.1665v1","created_at":"2026-05-18T03:43:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.1665","created_at":"2026-05-18T03:43:53Z"},{"alias_kind":"pith_short_12","alias_value":"H6KX4GHI4OAN","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"H6KX4GHI4OANQRUV","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"H6KX4GHI","created_at":"2026-05-18T12:27:06Z"}],"graph_snapshots":[{"event_id":"sha256:8d2aa3e2e3dd502c9d5488f4cda1b06aef8dbca39cf8c3d47b452e0d67c86b18","target":"graph","created_at":"2026-05-18T03:43:53Z","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":"Traditional approaches to automatic AND-parallelization of logic programs rely on some static analysis to identify independent goals that can be safely and efficiently run in parallel in any possible execution. In this paper, we present a novel technique for generating annotations for independent AND-parallelism that is based on partial evaluation. Basically, we augment a simple partial evaluation procedure with (run-time) groundness and variable sharing information so that parallel conjunctions are added to the residual clauses when the conditions for independence are met. In contrast to prev","authors_text":"Germ\\'an Vidal","cross_cats":["cs.SE"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2012-10-05T07:38:35Z","title":"Annotation of Logic Programs for Independent AND-Parallelism by Partial Evaluation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.1665","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:c7b724fc4bb294c229e24260f0e108ffd59db439da3069f6899e724e0e8d69b6","target":"record","created_at":"2026-05-18T03:43:53Z","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":"f2ce26f817d21cb969d29296bed168a3f1cbfb507581eb900739948ea20c02de","cross_cats_sorted":["cs.SE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2012-10-05T07:38:35Z","title_canon_sha256":"704e8a8b21e9517c444f0a7315c013e1cd01d0e94038d0907d5318a5dbbba0b3"},"schema_version":"1.0","source":{"id":"1210.1665","kind":"arxiv","version":1}},"canonical_sha256":"3f957e18e8e380d84695f9148938eb46fffb810291a2057371698717ee80f345","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3f957e18e8e380d84695f9148938eb46fffb810291a2057371698717ee80f345","first_computed_at":"2026-05-18T03:43:53.660646Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:43:53.660646Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pM9be+v1T3UH3EjZajQsthTJoQDuyunUkPSv9GoT3xl01f1zpDsV4qYNhEMTZ2cHB38CAOA45384iBgKsVXNDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:43:53.661214Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.1665","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c7b724fc4bb294c229e24260f0e108ffd59db439da3069f6899e724e0e8d69b6","sha256:8d2aa3e2e3dd502c9d5488f4cda1b06aef8dbca39cf8c3d47b452e0d67c86b18"],"state_sha256":"da7160dfb3db956d027438a83fb188a68495f5443b76e62cc16f715af8911382"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iLZ2WtmgHQL3cSoyjUhYGQ+YW0zecLRaC1ERKjrFLri48S16TNh8SnZm55jq3R1oUZjR+PnWqZNqKpZuSiCzCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T20:51:31.227506Z","bundle_sha256":"94f0e08083530dc811ae7d8f2e151aaa5eb8437106e9f40fb545e8150cf3792e"}}