{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:4WITZP7VMBUBWMHTZNFF7XQWOE","short_pith_number":"pith:4WITZP7V","canonical_record":{"source":{"id":"2606.10611","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2026-06-09T09:11:36Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"2d72c5b7f4fb1f3c76ec7de60ac22c2ed7480ed9072d9b29cbeb6b637619d5f0","abstract_canon_sha256":"45a3c55f4b9552b89eaff8a1d36f0640d52b8bcedb332ff0b840ecff801d08b8"},"schema_version":"1.0"},"canonical_sha256":"e5913cbff560681b30f3cb4a5fde16712d98e8b4c38690570fe47f29fb81b267","source":{"kind":"arxiv","id":"2606.10611","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.10611","created_at":"2026-06-10T01:10:29Z"},{"alias_kind":"arxiv_version","alias_value":"2606.10611v1","created_at":"2026-06-10T01:10:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.10611","created_at":"2026-06-10T01:10:29Z"},{"alias_kind":"pith_short_12","alias_value":"4WITZP7VMBUB","created_at":"2026-06-10T01:10:29Z"},{"alias_kind":"pith_short_16","alias_value":"4WITZP7VMBUBWMHT","created_at":"2026-06-10T01:10:29Z"},{"alias_kind":"pith_short_8","alias_value":"4WITZP7V","created_at":"2026-06-10T01:10:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:4WITZP7VMBUBWMHTZNFF7XQWOE","target":"record","payload":{"canonical_record":{"source":{"id":"2606.10611","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2026-06-09T09:11:36Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"2d72c5b7f4fb1f3c76ec7de60ac22c2ed7480ed9072d9b29cbeb6b637619d5f0","abstract_canon_sha256":"45a3c55f4b9552b89eaff8a1d36f0640d52b8bcedb332ff0b840ecff801d08b8"},"schema_version":"1.0"},"canonical_sha256":"e5913cbff560681b30f3cb4a5fde16712d98e8b4c38690570fe47f29fb81b267","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-10T01:10:29.398650Z","signature_b64":"uFdi+CfRoUFTm8uB4EGpZtvjTg2ot0x+KLeq1QjbKLQip5/8sbDOjJ158JjqVM4zOnzdTZaTrvedK6u88v3lDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e5913cbff560681b30f3cb4a5fde16712d98e8b4c38690570fe47f29fb81b267","last_reissued_at":"2026-06-10T01:10:29.397765Z","signature_status":"signed_v1","first_computed_at":"2026-06-10T01:10:29.397765Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.10611","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-06-10T01:10:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qWW1FyBLXreB9V84bI440Y5jIcuq5cO4oK3s9HSZMrP0+QF/eD8KIXvo66IRDcz5onA80nYehHUcjL33LjLoCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T05:26:15.553063Z"},"content_sha256":"9e406cc41edea326161dfe1951c2fcce64260d4275d09d8581cc42b0f3faf63c","schema_version":"1.0","event_id":"sha256:9e406cc41edea326161dfe1951c2fcce64260d4275d09d8581cc42b0f3faf63c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:4WITZP7VMBUBWMHTZNFF7XQWOE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Geometry-Aware Reinforcement Learning for 2D Irregular Nesting","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.LG","authors_text":"Auguste Lehuger, Guillaume Henon-Just","submitted_at":"2026-06-09T09:11:36Z","abstract_excerpt":"Traditional heuristic solvers for the 2D irregular nesting problem share a fundamental limitation: they are blind to polygon geometry, relying on guided brute-force to navigate the continuous placement space with minimal geometrical guidance. In this paper, we argue that Reinforcement Learning is uniquely positioned to overcome this bottleneck. By pairing an optimization policy with a geometry-aware neural encoder, an agent can automatically discover rich geometric priors directly from data, utilizing these learned intuitions to strategically guide exploration. To realize this, we introduce th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.10611","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/2606.10611/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-06-10T01:10:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RSnAV6me5AxFE+xzsGozoKDF5A0UGO4Ie7F24V/FhJgYDi3kcDWzu6A6m4K6sGl79aWDUyvH6r0tsDSibkPnAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T05:26:15.553505Z"},"content_sha256":"64a5e7bbd538325b33b6641482e14b6e268560e9901ccc1e7e772660d9a37299","schema_version":"1.0","event_id":"sha256:64a5e7bbd538325b33b6641482e14b6e268560e9901ccc1e7e772660d9a37299"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4WITZP7VMBUBWMHTZNFF7XQWOE/bundle.json","state_url":"https://pith.science/pith/4WITZP7VMBUBWMHTZNFF7XQWOE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4WITZP7VMBUBWMHTZNFF7XQWOE/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-01T05:26:15Z","links":{"resolver":"https://pith.science/pith/4WITZP7VMBUBWMHTZNFF7XQWOE","bundle":"https://pith.science/pith/4WITZP7VMBUBWMHTZNFF7XQWOE/bundle.json","state":"https://pith.science/pith/4WITZP7VMBUBWMHTZNFF7XQWOE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4WITZP7VMBUBWMHTZNFF7XQWOE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:4WITZP7VMBUBWMHTZNFF7XQWOE","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":"45a3c55f4b9552b89eaff8a1d36f0640d52b8bcedb332ff0b840ecff801d08b8","cross_cats_sorted":["cs.CV"],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2026-06-09T09:11:36Z","title_canon_sha256":"2d72c5b7f4fb1f3c76ec7de60ac22c2ed7480ed9072d9b29cbeb6b637619d5f0"},"schema_version":"1.0","source":{"id":"2606.10611","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.10611","created_at":"2026-06-10T01:10:29Z"},{"alias_kind":"arxiv_version","alias_value":"2606.10611v1","created_at":"2026-06-10T01:10:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.10611","created_at":"2026-06-10T01:10:29Z"},{"alias_kind":"pith_short_12","alias_value":"4WITZP7VMBUB","created_at":"2026-06-10T01:10:29Z"},{"alias_kind":"pith_short_16","alias_value":"4WITZP7VMBUBWMHT","created_at":"2026-06-10T01:10:29Z"},{"alias_kind":"pith_short_8","alias_value":"4WITZP7V","created_at":"2026-06-10T01:10:29Z"}],"graph_snapshots":[{"event_id":"sha256:64a5e7bbd538325b33b6641482e14b6e268560e9901ccc1e7e772660d9a37299","target":"graph","created_at":"2026-06-10T01:10:29Z","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/2606.10611/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Traditional heuristic solvers for the 2D irregular nesting problem share a fundamental limitation: they are blind to polygon geometry, relying on guided brute-force to navigate the continuous placement space with minimal geometrical guidance. In this paper, we argue that Reinforcement Learning is uniquely positioned to overcome this bottleneck. By pairing an optimization policy with a geometry-aware neural encoder, an agent can automatically discover rich geometric priors directly from data, utilizing these learned intuitions to strategically guide exploration. To realize this, we introduce th","authors_text":"Auguste Lehuger, Guillaume Henon-Just","cross_cats":["cs.CV"],"headline":"","license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2026-06-09T09:11:36Z","title":"Geometry-Aware Reinforcement Learning for 2D Irregular Nesting"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.10611","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:9e406cc41edea326161dfe1951c2fcce64260d4275d09d8581cc42b0f3faf63c","target":"record","created_at":"2026-06-10T01:10:29Z","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":"45a3c55f4b9552b89eaff8a1d36f0640d52b8bcedb332ff0b840ecff801d08b8","cross_cats_sorted":["cs.CV"],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2026-06-09T09:11:36Z","title_canon_sha256":"2d72c5b7f4fb1f3c76ec7de60ac22c2ed7480ed9072d9b29cbeb6b637619d5f0"},"schema_version":"1.0","source":{"id":"2606.10611","kind":"arxiv","version":1}},"canonical_sha256":"e5913cbff560681b30f3cb4a5fde16712d98e8b4c38690570fe47f29fb81b267","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e5913cbff560681b30f3cb4a5fde16712d98e8b4c38690570fe47f29fb81b267","first_computed_at":"2026-06-10T01:10:29.397765Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-10T01:10:29.397765Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uFdi+CfRoUFTm8uB4EGpZtvjTg2ot0x+KLeq1QjbKLQip5/8sbDOjJ158JjqVM4zOnzdTZaTrvedK6u88v3lDA==","signature_status":"signed_v1","signed_at":"2026-06-10T01:10:29.398650Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.10611","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9e406cc41edea326161dfe1951c2fcce64260d4275d09d8581cc42b0f3faf63c","sha256:64a5e7bbd538325b33b6641482e14b6e268560e9901ccc1e7e772660d9a37299"],"state_sha256":"dc0f27f426f3384539ba96608f6188cc77ef2bcc6269eb72b1d05f29d1ab5861"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cA29uUd97WeDXZGe5eBnpbN3Gya9VOEIdnM0xgHbYbzdv5z37p2xdRDk8TBUUvs7AKLIaXIF2qO5b3mo/tHxCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-01T05:26:15.556545Z","bundle_sha256":"94ef36babaf5ffd0dbf20560203bae45ed19cb69e88d2d0f3268d3b45ef41d63"}}