{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:3EQ7TFNSWMDHPAWVWADH3V2OTO","short_pith_number":"pith:3EQ7TFNS","canonical_record":{"source":{"id":"2506.01880","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.PL","submitted_at":"2025-06-02T17:09:59Z","cross_cats_sorted":[],"title_canon_sha256":"4b5654b2965cae20b89d13c6064585977613ad5e078e6abf18b09cb47eb8b2b0","abstract_canon_sha256":"2769536c570e50fa11bfa2ad0602fb00f04ea1e3db74c7017b905423013123fc"},"schema_version":"1.0"},"canonical_sha256":"d921f995b2b3067782d5b0067dd74e9bb68dcfbcb23de98f5fca966468110c8f","source":{"kind":"arxiv","id":"2506.01880","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.01880","created_at":"2026-07-05T11:14:20Z"},{"alias_kind":"arxiv_version","alias_value":"2506.01880v1","created_at":"2026-07-05T11:14:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.01880","created_at":"2026-07-05T11:14:20Z"},{"alias_kind":"pith_short_12","alias_value":"3EQ7TFNSWMDH","created_at":"2026-07-05T11:14:20Z"},{"alias_kind":"pith_short_16","alias_value":"3EQ7TFNSWMDHPAWV","created_at":"2026-07-05T11:14:20Z"},{"alias_kind":"pith_short_8","alias_value":"3EQ7TFNS","created_at":"2026-07-05T11:14:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:3EQ7TFNSWMDHPAWVWADH3V2OTO","target":"record","payload":{"canonical_record":{"source":{"id":"2506.01880","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.PL","submitted_at":"2025-06-02T17:09:59Z","cross_cats_sorted":[],"title_canon_sha256":"4b5654b2965cae20b89d13c6064585977613ad5e078e6abf18b09cb47eb8b2b0","abstract_canon_sha256":"2769536c570e50fa11bfa2ad0602fb00f04ea1e3db74c7017b905423013123fc"},"schema_version":"1.0"},"canonical_sha256":"d921f995b2b3067782d5b0067dd74e9bb68dcfbcb23de98f5fca966468110c8f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:14:20.826502Z","signature_b64":"tiE7Y/zLCNVtEfzo6RB7A7ryd54Omgf/YMY0tEr/K/aL1Yye33bNVSbqi3yi0y0ivoyEDRT/MAQ1j/MVVWo+Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d921f995b2b3067782d5b0067dd74e9bb68dcfbcb23de98f5fca966468110c8f","last_reissued_at":"2026-07-05T11:14:20.826084Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:14:20.826084Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2506.01880","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-05T11:14:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BBo7PMzQsYnIYGfXTjDFgrC5Y1P/BaY2j8s+iyWLTI8ZYMp+UvvL+U1QbR98XnKmLOHF9/pLb7UT+6XGqdXxBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T06:34:51.289830Z"},"content_sha256":"614721628d0a9129453070ba95f0ac40af4d7c5496369d9d453ed7b4af4b5138","schema_version":"1.0","event_id":"sha256:614721628d0a9129453070ba95f0ac40af4d7c5496369d9d453ed7b4af4b5138"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:3EQ7TFNSWMDHPAWVWADH3V2OTO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Pearl: Automatic Code Optimization Using Deep Reinforcement Learning","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Djamel Rassem Lamouri, Iheb Nassim Aouadj, Riyadh Baghdadi, Smail Kourta","submitted_at":"2025-06-02T17:09:59Z","abstract_excerpt":"Compilers are crucial in optimizing programs and accelerating their execution. However, optimizing programs automatically using compilers is not trivial. Recent work has attempted to use reinforcement learning (RL) to solve this problem. It has limitations though. Current methods either do not support the optimization of general loop nests or can only be used to optimize loop nests seen during training. In this paper, we propose Pearl, a novel framework that uses deep reinforcement learning to automate compiler code optimization. It uses an RL agent to select the sequence of code optimizations"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.01880","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/2506.01880/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-05T11:14:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4xZx62PpypMnmBdckxHCXhIJnR8kmxaqo1ZfTm2bgUzmQcnHRRIMsG4CB86W+Ukn566nY27GAg11+GKqj2b8BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T06:34:51.290326Z"},"content_sha256":"804b3b71b1c5243259cf03da9c944f23cf90d9d3f2f9ae835b83e437b5b4c648","schema_version":"1.0","event_id":"sha256:804b3b71b1c5243259cf03da9c944f23cf90d9d3f2f9ae835b83e437b5b4c648"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3EQ7TFNSWMDHPAWVWADH3V2OTO/bundle.json","state_url":"https://pith.science/pith/3EQ7TFNSWMDHPAWVWADH3V2OTO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3EQ7TFNSWMDHPAWVWADH3V2OTO/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-08-09T06:34:51Z","links":{"resolver":"https://pith.science/pith/3EQ7TFNSWMDHPAWVWADH3V2OTO","bundle":"https://pith.science/pith/3EQ7TFNSWMDHPAWVWADH3V2OTO/bundle.json","state":"https://pith.science/pith/3EQ7TFNSWMDHPAWVWADH3V2OTO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3EQ7TFNSWMDHPAWVWADH3V2OTO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:3EQ7TFNSWMDHPAWVWADH3V2OTO","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":"2769536c570e50fa11bfa2ad0602fb00f04ea1e3db74c7017b905423013123fc","cross_cats_sorted":[],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.PL","submitted_at":"2025-06-02T17:09:59Z","title_canon_sha256":"4b5654b2965cae20b89d13c6064585977613ad5e078e6abf18b09cb47eb8b2b0"},"schema_version":"1.0","source":{"id":"2506.01880","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.01880","created_at":"2026-07-05T11:14:20Z"},{"alias_kind":"arxiv_version","alias_value":"2506.01880v1","created_at":"2026-07-05T11:14:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.01880","created_at":"2026-07-05T11:14:20Z"},{"alias_kind":"pith_short_12","alias_value":"3EQ7TFNSWMDH","created_at":"2026-07-05T11:14:20Z"},{"alias_kind":"pith_short_16","alias_value":"3EQ7TFNSWMDHPAWV","created_at":"2026-07-05T11:14:20Z"},{"alias_kind":"pith_short_8","alias_value":"3EQ7TFNS","created_at":"2026-07-05T11:14:20Z"}],"graph_snapshots":[{"event_id":"sha256:804b3b71b1c5243259cf03da9c944f23cf90d9d3f2f9ae835b83e437b5b4c648","target":"graph","created_at":"2026-07-05T11:14:20Z","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/2506.01880/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Compilers are crucial in optimizing programs and accelerating their execution. However, optimizing programs automatically using compilers is not trivial. Recent work has attempted to use reinforcement learning (RL) to solve this problem. It has limitations though. Current methods either do not support the optimization of general loop nests or can only be used to optimize loop nests seen during training. In this paper, we propose Pearl, a novel framework that uses deep reinforcement learning to automate compiler code optimization. It uses an RL agent to select the sequence of code optimizations","authors_text":"Djamel Rassem Lamouri, Iheb Nassim Aouadj, Riyadh Baghdadi, Smail Kourta","cross_cats":[],"headline":"","license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.PL","submitted_at":"2025-06-02T17:09:59Z","title":"Pearl: Automatic Code Optimization Using Deep Reinforcement Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.01880","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:614721628d0a9129453070ba95f0ac40af4d7c5496369d9d453ed7b4af4b5138","target":"record","created_at":"2026-07-05T11:14:20Z","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":"2769536c570e50fa11bfa2ad0602fb00f04ea1e3db74c7017b905423013123fc","cross_cats_sorted":[],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.PL","submitted_at":"2025-06-02T17:09:59Z","title_canon_sha256":"4b5654b2965cae20b89d13c6064585977613ad5e078e6abf18b09cb47eb8b2b0"},"schema_version":"1.0","source":{"id":"2506.01880","kind":"arxiv","version":1}},"canonical_sha256":"d921f995b2b3067782d5b0067dd74e9bb68dcfbcb23de98f5fca966468110c8f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d921f995b2b3067782d5b0067dd74e9bb68dcfbcb23de98f5fca966468110c8f","first_computed_at":"2026-07-05T11:14:20.826084Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:14:20.826084Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tiE7Y/zLCNVtEfzo6RB7A7ryd54Omgf/YMY0tEr/K/aL1Yye33bNVSbqi3yi0y0ivoyEDRT/MAQ1j/MVVWo+Ag==","signature_status":"signed_v1","signed_at":"2026-07-05T11:14:20.826502Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.01880","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:614721628d0a9129453070ba95f0ac40af4d7c5496369d9d453ed7b4af4b5138","sha256:804b3b71b1c5243259cf03da9c944f23cf90d9d3f2f9ae835b83e437b5b4c648"],"state_sha256":"ceb3ab53fe4ea8d081a1d126cdd7dfd580b0cc028aea1848b028e653cdac2e3d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FlI4NUKgaLY7gVO+aUHxdzhx6JMS+KRS9PsShR98d2stXvRP6fYZMKkb/uNO7qfomkLlzbybdVU+DKbNaphWDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T06:34:51.293694Z","bundle_sha256":"9c0c32e557948a10f0ff186e38333175a52cbb9831d719fb61631200cfadc0c2"}}