{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2006:QAUH3OUIYPKJKKWJJ67CZFIOTR","short_pith_number":"pith:QAUH3OUI","canonical_record":{"source":{"id":"cs/0603100","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.PL","submitted_at":"2006-03-26T20:27:40Z","cross_cats_sorted":[],"title_canon_sha256":"6de705a5038e3739ef92a797443f19c4b6c046e20ae21371f3d80ed80ae0526f","abstract_canon_sha256":"e1fedb26c0159c6399ae572fc34eaea83bb46bdb785c01285169bb657d67183f"},"schema_version":"1.0"},"canonical_sha256":"80287dba88c3d4952ac94fbe2c950e9c5049487d96e63166898a23e63742ef58","source":{"kind":"arxiv","id":"cs/0603100","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0603100","created_at":"2026-07-04T14:53:53Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0603100v1","created_at":"2026-07-04T14:53:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0603100","created_at":"2026-07-04T14:53:53Z"},{"alias_kind":"pith_short_12","alias_value":"QAUH3OUIYPKJ","created_at":"2026-07-04T14:53:53Z"},{"alias_kind":"pith_short_16","alias_value":"QAUH3OUIYPKJKKWJ","created_at":"2026-07-04T14:53:53Z"},{"alias_kind":"pith_short_8","alias_value":"QAUH3OUI","created_at":"2026-07-04T14:53:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2006:QAUH3OUIYPKJKKWJJ67CZFIOTR","target":"record","payload":{"canonical_record":{"source":{"id":"cs/0603100","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.PL","submitted_at":"2006-03-26T20:27:40Z","cross_cats_sorted":[],"title_canon_sha256":"6de705a5038e3739ef92a797443f19c4b6c046e20ae21371f3d80ed80ae0526f","abstract_canon_sha256":"e1fedb26c0159c6399ae572fc34eaea83bb46bdb785c01285169bb657d67183f"},"schema_version":"1.0"},"canonical_sha256":"80287dba88c3d4952ac94fbe2c950e9c5049487d96e63166898a23e63742ef58","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:53:53.335770Z","signature_b64":"eXckSO1ZCwz9GWsWAsqSCELsRnqhC1BnV20KF31KGujbdITdUfJkNcf0SrxzJ5G8CY83TeyPQ/LTurskOA1ADQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"80287dba88c3d4952ac94fbe2c950e9c5049487d96e63166898a23e63742ef58","last_reissued_at":"2026-07-04T14:53:53.335278Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:53:53.335278Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"cs/0603100","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-07-04T14:53:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VhwOqlYDrYGF8N3eZKNmSHZiWE6bxB2Wi/iVIPX5z7Sr11vDdUArHqxWdfPRE+j7A8JP0wGCMSJOeJ4kGq4TBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-08T03:00:47.392939Z"},"content_sha256":"97e0a5dfedf1a202df099e4dcaf5d9920d726a23ebcff855a9954067a8a1f358","schema_version":"1.0","event_id":"sha256:97e0a5dfedf1a202df099e4dcaf5d9920d726a23ebcff855a9954067a8a1f358"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2006:QAUH3OUIYPKJKKWJJ67CZFIOTR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Compression of Prolog Programs","license":"","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Alin Suciu, Kalman Pusztai","submitted_at":"2006-03-26T20:27:40Z","abstract_excerpt":"We propose a special-purpose class of compression algorithms for efficient compression of Prolog programs. It is a dictionary-based compression method, specially designed for the compression of Prolog code, and therefore we name it PCA (Prolog Compression Algorithm). According to the experimental results this method provides better compression than state-of-the-art general-purpose compression algorithms. Since the algorithm works with Prolog syntactic entities (e.g. atoms, terms, etc.) the implementation of a Prolog prototype is straightforward and very easy to use in any Prolog application th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0603100","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/cs/0603100/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-04T14:53:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d2+f3hLkrNr9u9wVFe3zzzr2eGCVp77jvxXqLv4AWVbhsdjMEzxJXpIxZslYH6MlM+XRytxRaA8i67aKJuOyDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-08T03:00:47.393301Z"},"content_sha256":"96e409c7249dd72f8b4794c771948e5706f7b8475545cafd0328734556239070","schema_version":"1.0","event_id":"sha256:96e409c7249dd72f8b4794c771948e5706f7b8475545cafd0328734556239070"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QAUH3OUIYPKJKKWJJ67CZFIOTR/bundle.json","state_url":"https://pith.science/pith/QAUH3OUIYPKJKKWJJ67CZFIOTR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QAUH3OUIYPKJKKWJJ67CZFIOTR/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-07-08T03:00:47Z","links":{"resolver":"https://pith.science/pith/QAUH3OUIYPKJKKWJJ67CZFIOTR","bundle":"https://pith.science/pith/QAUH3OUIYPKJKKWJJ67CZFIOTR/bundle.json","state":"https://pith.science/pith/QAUH3OUIYPKJKKWJJ67CZFIOTR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QAUH3OUIYPKJKKWJJ67CZFIOTR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2006:QAUH3OUIYPKJKKWJJ67CZFIOTR","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":"e1fedb26c0159c6399ae572fc34eaea83bb46bdb785c01285169bb657d67183f","cross_cats_sorted":[],"license":"","primary_cat":"cs.PL","submitted_at":"2006-03-26T20:27:40Z","title_canon_sha256":"6de705a5038e3739ef92a797443f19c4b6c046e20ae21371f3d80ed80ae0526f"},"schema_version":"1.0","source":{"id":"cs/0603100","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0603100","created_at":"2026-07-04T14:53:53Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0603100v1","created_at":"2026-07-04T14:53:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0603100","created_at":"2026-07-04T14:53:53Z"},{"alias_kind":"pith_short_12","alias_value":"QAUH3OUIYPKJ","created_at":"2026-07-04T14:53:53Z"},{"alias_kind":"pith_short_16","alias_value":"QAUH3OUIYPKJKKWJ","created_at":"2026-07-04T14:53:53Z"},{"alias_kind":"pith_short_8","alias_value":"QAUH3OUI","created_at":"2026-07-04T14:53:53Z"}],"graph_snapshots":[{"event_id":"sha256:96e409c7249dd72f8b4794c771948e5706f7b8475545cafd0328734556239070","target":"graph","created_at":"2026-07-04T14:53: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/cs/0603100/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We propose a special-purpose class of compression algorithms for efficient compression of Prolog programs. It is a dictionary-based compression method, specially designed for the compression of Prolog code, and therefore we name it PCA (Prolog Compression Algorithm). According to the experimental results this method provides better compression than state-of-the-art general-purpose compression algorithms. Since the algorithm works with Prolog syntactic entities (e.g. atoms, terms, etc.) the implementation of a Prolog prototype is straightforward and very easy to use in any Prolog application th","authors_text":"Alin Suciu, Kalman Pusztai","cross_cats":[],"headline":"","license":"","primary_cat":"cs.PL","submitted_at":"2006-03-26T20:27:40Z","title":"Efficient Compression of Prolog Programs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0603100","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:97e0a5dfedf1a202df099e4dcaf5d9920d726a23ebcff855a9954067a8a1f358","target":"record","created_at":"2026-07-04T14:53: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":"e1fedb26c0159c6399ae572fc34eaea83bb46bdb785c01285169bb657d67183f","cross_cats_sorted":[],"license":"","primary_cat":"cs.PL","submitted_at":"2006-03-26T20:27:40Z","title_canon_sha256":"6de705a5038e3739ef92a797443f19c4b6c046e20ae21371f3d80ed80ae0526f"},"schema_version":"1.0","source":{"id":"cs/0603100","kind":"arxiv","version":1}},"canonical_sha256":"80287dba88c3d4952ac94fbe2c950e9c5049487d96e63166898a23e63742ef58","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"80287dba88c3d4952ac94fbe2c950e9c5049487d96e63166898a23e63742ef58","first_computed_at":"2026-07-04T14:53:53.335278Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T14:53:53.335278Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eXckSO1ZCwz9GWsWAsqSCELsRnqhC1BnV20KF31KGujbdITdUfJkNcf0SrxzJ5G8CY83TeyPQ/LTurskOA1ADQ==","signature_status":"signed_v1","signed_at":"2026-07-04T14:53:53.335770Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0603100","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:97e0a5dfedf1a202df099e4dcaf5d9920d726a23ebcff855a9954067a8a1f358","sha256:96e409c7249dd72f8b4794c771948e5706f7b8475545cafd0328734556239070"],"state_sha256":"1a55ec20a332207c4ad8d6f413c04c50847560d54cb8926af2d890935288a08e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HmDuwJ2qrpcAehA7efYsoSYCwSc/SzVU3kEdFz94AMCnVqfvwnAccBdevp+M7hEXT3I/Y514XdXELC2By9jEAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-08T03:00:47.395208Z","bundle_sha256":"0e09ac38bdf885676b8502781f5ad168b7da1052b4cf581c214c1d794492d492"}}