{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:YI7EMO4V3YCFL4HTNT7ZMT4SSR","short_pith_number":"pith:YI7EMO4V","canonical_record":{"source":{"id":"2607.02390","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-07-02T16:25:10Z","cross_cats_sorted":[],"title_canon_sha256":"7bbd77dff77b93f74d300828db50b1725034e8a4bc2394e502f7d34fc98c3ffd","abstract_canon_sha256":"1771422e9672a21205ce089cb8ab03291e6899bbb406f74088f486201374c6ba"},"schema_version":"1.0"},"canonical_sha256":"c23e463b95de0455f0f36cff964f92944b022f21a7c967d576c5f2292a072173","source":{"kind":"arxiv","id":"2607.02390","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.02390","created_at":"2026-07-03T01:17:57Z"},{"alias_kind":"arxiv_version","alias_value":"2607.02390v1","created_at":"2026-07-03T01:17:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.02390","created_at":"2026-07-03T01:17:57Z"},{"alias_kind":"pith_short_12","alias_value":"YI7EMO4V3YCF","created_at":"2026-07-03T01:17:57Z"},{"alias_kind":"pith_short_16","alias_value":"YI7EMO4V3YCFL4HT","created_at":"2026-07-03T01:17:57Z"},{"alias_kind":"pith_short_8","alias_value":"YI7EMO4V","created_at":"2026-07-03T01:17:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:YI7EMO4V3YCFL4HTNT7ZMT4SSR","target":"record","payload":{"canonical_record":{"source":{"id":"2607.02390","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-07-02T16:25:10Z","cross_cats_sorted":[],"title_canon_sha256":"7bbd77dff77b93f74d300828db50b1725034e8a4bc2394e502f7d34fc98c3ffd","abstract_canon_sha256":"1771422e9672a21205ce089cb8ab03291e6899bbb406f74088f486201374c6ba"},"schema_version":"1.0"},"canonical_sha256":"c23e463b95de0455f0f36cff964f92944b022f21a7c967d576c5f2292a072173","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-03T01:17:57.467063Z","signature_b64":"kvVpZnP/3M1j8/PGFm2vwlN046gbuVSW6SUkdZ71jvsZgtrpPM0yS2Y8XXxT4m9kCDisM/KIKJ1DXZ4JQa+YAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c23e463b95de0455f0f36cff964f92944b022f21a7c967d576c5f2292a072173","last_reissued_at":"2026-07-03T01:17:57.466689Z","signature_status":"signed_v1","first_computed_at":"2026-07-03T01:17:57.466689Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2607.02390","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-03T01:17:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aMhAj+HbYEOgo63ItvsH3n0qfhU7fR9P1vh6Bg1KucVDcKSR2ico/BFVcOY7WgfZ4xqxHRhA6avw6vp/jyGzBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T23:28:00.289605Z"},"content_sha256":"bca8a431df0a4d802bc402e1918242905a23737dbaaebc33e5e26b2867708402","schema_version":"1.0","event_id":"sha256:bca8a431df0a4d802bc402e1918242905a23737dbaaebc33e5e26b2867708402"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:YI7EMO4V3YCFL4HTNT7ZMT4SSR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"DecompRL: Solving Harder Problems by Learning Modular Code Generation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Fabian Gloeckle, Francis Bach, Gabriel Synnaeve, Juliette Decugis, Taco Cohen","submitted_at":"2026-07-02T16:25:10Z","abstract_excerpt":"How can Large Language Models (LLMs) solve problems they currently cannot? Repeated sampling scales test-time compute but GPU cost grows linearly with attempts, while reinforcement learning (RL) with verifiable rewards improves single-attempt accuracy at the expense of sample diversity. Both strategies ultimately fail when the base policy has near-zero probability of producing a correct solution: no amount of sampling or gradient signal can overcome a search space that is simply too large. We take a different approach: rather than sampling harder, we make the task easier by decomposing problem"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.02390","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/2607.02390/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-03T01:17:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j/iQDeIa/spBl3BLIDz5LtzG7Jh8K9Ep+0aGWq9dCYOKnLwvqJxOWpNouDdwZl44Qgkls0fN13O31aRc378uDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T23:28:00.290173Z"},"content_sha256":"dea2093907943c76a8d1d368242684f83a5b5b90f94a02ceee2cb49b7b69f29b","schema_version":"1.0","event_id":"sha256:dea2093907943c76a8d1d368242684f83a5b5b90f94a02ceee2cb49b7b69f29b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YI7EMO4V3YCFL4HTNT7ZMT4SSR/bundle.json","state_url":"https://pith.science/pith/YI7EMO4V3YCFL4HTNT7ZMT4SSR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YI7EMO4V3YCFL4HTNT7ZMT4SSR/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-03T23:28:00Z","links":{"resolver":"https://pith.science/pith/YI7EMO4V3YCFL4HTNT7ZMT4SSR","bundle":"https://pith.science/pith/YI7EMO4V3YCFL4HTNT7ZMT4SSR/bundle.json","state":"https://pith.science/pith/YI7EMO4V3YCFL4HTNT7ZMT4SSR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YI7EMO4V3YCFL4HTNT7ZMT4SSR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:YI7EMO4V3YCFL4HTNT7ZMT4SSR","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":"1771422e9672a21205ce089cb8ab03291e6899bbb406f74088f486201374c6ba","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-07-02T16:25:10Z","title_canon_sha256":"7bbd77dff77b93f74d300828db50b1725034e8a4bc2394e502f7d34fc98c3ffd"},"schema_version":"1.0","source":{"id":"2607.02390","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.02390","created_at":"2026-07-03T01:17:57Z"},{"alias_kind":"arxiv_version","alias_value":"2607.02390v1","created_at":"2026-07-03T01:17:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.02390","created_at":"2026-07-03T01:17:57Z"},{"alias_kind":"pith_short_12","alias_value":"YI7EMO4V3YCF","created_at":"2026-07-03T01:17:57Z"},{"alias_kind":"pith_short_16","alias_value":"YI7EMO4V3YCFL4HT","created_at":"2026-07-03T01:17:57Z"},{"alias_kind":"pith_short_8","alias_value":"YI7EMO4V","created_at":"2026-07-03T01:17:57Z"}],"graph_snapshots":[{"event_id":"sha256:dea2093907943c76a8d1d368242684f83a5b5b90f94a02ceee2cb49b7b69f29b","target":"graph","created_at":"2026-07-03T01:17:57Z","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/2607.02390/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"How can Large Language Models (LLMs) solve problems they currently cannot? Repeated sampling scales test-time compute but GPU cost grows linearly with attempts, while reinforcement learning (RL) with verifiable rewards improves single-attempt accuracy at the expense of sample diversity. Both strategies ultimately fail when the base policy has near-zero probability of producing a correct solution: no amount of sampling or gradient signal can overcome a search space that is simply too large. We take a different approach: rather than sampling harder, we make the task easier by decomposing problem","authors_text":"Fabian Gloeckle, Francis Bach, Gabriel Synnaeve, Juliette Decugis, Taco Cohen","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-07-02T16:25:10Z","title":"DecompRL: Solving Harder Problems by Learning Modular Code Generation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.02390","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:bca8a431df0a4d802bc402e1918242905a23737dbaaebc33e5e26b2867708402","target":"record","created_at":"2026-07-03T01:17:57Z","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":"1771422e9672a21205ce089cb8ab03291e6899bbb406f74088f486201374c6ba","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-07-02T16:25:10Z","title_canon_sha256":"7bbd77dff77b93f74d300828db50b1725034e8a4bc2394e502f7d34fc98c3ffd"},"schema_version":"1.0","source":{"id":"2607.02390","kind":"arxiv","version":1}},"canonical_sha256":"c23e463b95de0455f0f36cff964f92944b022f21a7c967d576c5f2292a072173","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c23e463b95de0455f0f36cff964f92944b022f21a7c967d576c5f2292a072173","first_computed_at":"2026-07-03T01:17:57.466689Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-03T01:17:57.466689Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kvVpZnP/3M1j8/PGFm2vwlN046gbuVSW6SUkdZ71jvsZgtrpPM0yS2Y8XXxT4m9kCDisM/KIKJ1DXZ4JQa+YAQ==","signature_status":"signed_v1","signed_at":"2026-07-03T01:17:57.467063Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.02390","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bca8a431df0a4d802bc402e1918242905a23737dbaaebc33e5e26b2867708402","sha256:dea2093907943c76a8d1d368242684f83a5b5b90f94a02ceee2cb49b7b69f29b"],"state_sha256":"54feea56cc023c9e8c63ee9fd95ee096eb88810eb8fec5248eb1a69cc018f9ca"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+wN4nKcVFwzWIBH2CoW7Vf1Ip/+5iaSBpZWrHpKBnOKc7OqemtOLuCphDDKnpvl8HG5ImG8ryIOeElT8usjFBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-03T23:28:00.292690Z","bundle_sha256":"4b9f274b20d14ff5e3ef315a150a7df30b61881d19539c2048bc6d78eae82b25"}}