{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:HGECUWRELUNV7AS7XMR7PMUNKG","short_pith_number":"pith:HGECUWRE","canonical_record":{"source":{"id":"2506.14162","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-06-17T03:53:18Z","cross_cats_sorted":[],"title_canon_sha256":"748cb2c6f7572b48466ac9128b527c8e31f2a78fde2ef1013f55dc728057d920","abstract_canon_sha256":"12cdabf8abf091acc423f09e52314c71026e16820364afbf95cb49508e2c29f3"},"schema_version":"1.0"},"canonical_sha256":"39882a5a245d1b5f825fbb23f7b28d51bdc740e25daf0bc50f0ce7106ff6aaae","source":{"kind":"arxiv","id":"2506.14162","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.14162","created_at":"2026-07-05T11:22:50Z"},{"alias_kind":"arxiv_version","alias_value":"2506.14162v1","created_at":"2026-07-05T11:22:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.14162","created_at":"2026-07-05T11:22:50Z"},{"alias_kind":"pith_short_12","alias_value":"HGECUWRELUNV","created_at":"2026-07-05T11:22:50Z"},{"alias_kind":"pith_short_16","alias_value":"HGECUWRELUNV7AS7","created_at":"2026-07-05T11:22:50Z"},{"alias_kind":"pith_short_8","alias_value":"HGECUWRE","created_at":"2026-07-05T11:22:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:HGECUWRELUNV7AS7XMR7PMUNKG","target":"record","payload":{"canonical_record":{"source":{"id":"2506.14162","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-06-17T03:53:18Z","cross_cats_sorted":[],"title_canon_sha256":"748cb2c6f7572b48466ac9128b527c8e31f2a78fde2ef1013f55dc728057d920","abstract_canon_sha256":"12cdabf8abf091acc423f09e52314c71026e16820364afbf95cb49508e2c29f3"},"schema_version":"1.0"},"canonical_sha256":"39882a5a245d1b5f825fbb23f7b28d51bdc740e25daf0bc50f0ce7106ff6aaae","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:22:50.129383Z","signature_b64":"do/RyWZH3ALaFm+xlyyeoexNr1vfYRw+j39dXkHBtlQSbG0mRi1JAoporaqmnfevN2pAQ/eI24L92hMmC/yVBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"39882a5a245d1b5f825fbb23f7b28d51bdc740e25daf0bc50f0ce7106ff6aaae","last_reissued_at":"2026-07-05T11:22:50.128988Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:22:50.128988Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2506.14162","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:22:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wW0JcDu4mXTiawl+uEr/+6CxBA7kh6ND+kCMbFM2x+eYWRSNIFv4UbXmrfSJS6RfG9mRgNc05HIoH4051h7DCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-17T05:15:49.954299Z"},"content_sha256":"00e113683675905d658ac011cb0bde9271daab6fb79a1bf2659a84c2589d20b2","schema_version":"1.0","event_id":"sha256:00e113683675905d658ac011cb0bde9271daab6fb79a1bf2659a84c2589d20b2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:HGECUWRELUNV7AS7XMR7PMUNKG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Common Benchmarks Undervalue the Generalization Power of Programmatic Policies","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Amirhossein Rajabpour, Kiarash Aghakasiri, Levi H. S. Lelis, Sandra Zilles","submitted_at":"2025-06-17T03:53:18Z","abstract_excerpt":"Algorithms for learning programmatic representations for sequential decision-making problems are often evaluated on out-of-distribution (OOD) problems, with the common conclusion that programmatic policies generalize better than neural policies on OOD problems. In this position paper, we argue that commonly used benchmarks undervalue the generalization capabilities of programmatic representations. We analyze the experiments of four papers from the literature and show that neural policies, which were shown not to generalize, can generalize as effectively as programmatic policies on OOD problems"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.14162","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.14162/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:22:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6RvfYkE+VB2NgPMTZD7eDRNvxU+VB9ssMI6XhLrgWpSxbYrqspDfrjPu3DsHKO76NgQDh7PvRPoByexUwKG6DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-17T05:15:49.954676Z"},"content_sha256":"efad0ed75fecb5544b138c8b7342d39e545c5fdae0cc8e646a134e2ad1148c52","schema_version":"1.0","event_id":"sha256:efad0ed75fecb5544b138c8b7342d39e545c5fdae0cc8e646a134e2ad1148c52"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HGECUWRELUNV7AS7XMR7PMUNKG/bundle.json","state_url":"https://pith.science/pith/HGECUWRELUNV7AS7XMR7PMUNKG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HGECUWRELUNV7AS7XMR7PMUNKG/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-17T05:15:49Z","links":{"resolver":"https://pith.science/pith/HGECUWRELUNV7AS7XMR7PMUNKG","bundle":"https://pith.science/pith/HGECUWRELUNV7AS7XMR7PMUNKG/bundle.json","state":"https://pith.science/pith/HGECUWRELUNV7AS7XMR7PMUNKG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HGECUWRELUNV7AS7XMR7PMUNKG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:HGECUWRELUNV7AS7XMR7PMUNKG","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":"12cdabf8abf091acc423f09e52314c71026e16820364afbf95cb49508e2c29f3","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-06-17T03:53:18Z","title_canon_sha256":"748cb2c6f7572b48466ac9128b527c8e31f2a78fde2ef1013f55dc728057d920"},"schema_version":"1.0","source":{"id":"2506.14162","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.14162","created_at":"2026-07-05T11:22:50Z"},{"alias_kind":"arxiv_version","alias_value":"2506.14162v1","created_at":"2026-07-05T11:22:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.14162","created_at":"2026-07-05T11:22:50Z"},{"alias_kind":"pith_short_12","alias_value":"HGECUWRELUNV","created_at":"2026-07-05T11:22:50Z"},{"alias_kind":"pith_short_16","alias_value":"HGECUWRELUNV7AS7","created_at":"2026-07-05T11:22:50Z"},{"alias_kind":"pith_short_8","alias_value":"HGECUWRE","created_at":"2026-07-05T11:22:50Z"}],"graph_snapshots":[{"event_id":"sha256:efad0ed75fecb5544b138c8b7342d39e545c5fdae0cc8e646a134e2ad1148c52","target":"graph","created_at":"2026-07-05T11:22:50Z","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.14162/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Algorithms for learning programmatic representations for sequential decision-making problems are often evaluated on out-of-distribution (OOD) problems, with the common conclusion that programmatic policies generalize better than neural policies on OOD problems. In this position paper, we argue that commonly used benchmarks undervalue the generalization capabilities of programmatic representations. We analyze the experiments of four papers from the literature and show that neural policies, which were shown not to generalize, can generalize as effectively as programmatic policies on OOD problems","authors_text":"Amirhossein Rajabpour, Kiarash Aghakasiri, Levi H. S. Lelis, Sandra Zilles","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-06-17T03:53:18Z","title":"Common Benchmarks Undervalue the Generalization Power of Programmatic Policies"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.14162","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:00e113683675905d658ac011cb0bde9271daab6fb79a1bf2659a84c2589d20b2","target":"record","created_at":"2026-07-05T11:22:50Z","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":"12cdabf8abf091acc423f09e52314c71026e16820364afbf95cb49508e2c29f3","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-06-17T03:53:18Z","title_canon_sha256":"748cb2c6f7572b48466ac9128b527c8e31f2a78fde2ef1013f55dc728057d920"},"schema_version":"1.0","source":{"id":"2506.14162","kind":"arxiv","version":1}},"canonical_sha256":"39882a5a245d1b5f825fbb23f7b28d51bdc740e25daf0bc50f0ce7106ff6aaae","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"39882a5a245d1b5f825fbb23f7b28d51bdc740e25daf0bc50f0ce7106ff6aaae","first_computed_at":"2026-07-05T11:22:50.128988Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:22:50.128988Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"do/RyWZH3ALaFm+xlyyeoexNr1vfYRw+j39dXkHBtlQSbG0mRi1JAoporaqmnfevN2pAQ/eI24L92hMmC/yVBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:22:50.129383Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.14162","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:00e113683675905d658ac011cb0bde9271daab6fb79a1bf2659a84c2589d20b2","sha256:efad0ed75fecb5544b138c8b7342d39e545c5fdae0cc8e646a134e2ad1148c52"],"state_sha256":"40a19d061ec888cfe80623c814487eb2cf7436838c0a92529ec9cc915f6a5fe6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CA2zIEY00265BkbCxwM5f9hCn0GqKGvzi6OWeIsRP6hXVoB2e+ToV6vSRgFlEiUC49j0vczWsm3EoCMRMUb1BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-17T05:15:49.956863Z","bundle_sha256":"400dcdd51dfe981511572ebb77d8776b42ca38b8199557f857119ad7f39edb98"}}