{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:G6KUH6Q77SYJFN62IZ7BCWT3XN","short_pith_number":"pith:G6KUH6Q7","canonical_record":{"source":{"id":"2508.20056","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-08-27T17:13:18Z","cross_cats_sorted":[],"title_canon_sha256":"62a7565ade688dfd40aa6645b3884aaa6da8e1d12345b38f0915b61287641a76","abstract_canon_sha256":"f46236c210da455f9913b5c82c85b57525b12917fe0f9e269dbde1498868eb5f"},"schema_version":"1.0"},"canonical_sha256":"379543fa1ffcb092b7da467e115a7bbb5cd846d3e6e32580ebc4a54beb61d3f6","source":{"kind":"arxiv","id":"2508.20056","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.20056","created_at":"2026-07-05T12:00:23Z"},{"alias_kind":"arxiv_version","alias_value":"2508.20056v1","created_at":"2026-07-05T12:00:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.20056","created_at":"2026-07-05T12:00:23Z"},{"alias_kind":"pith_short_12","alias_value":"G6KUH6Q77SYJ","created_at":"2026-07-05T12:00:23Z"},{"alias_kind":"pith_short_16","alias_value":"G6KUH6Q77SYJFN62","created_at":"2026-07-05T12:00:23Z"},{"alias_kind":"pith_short_8","alias_value":"G6KUH6Q7","created_at":"2026-07-05T12:00:23Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:G6KUH6Q77SYJFN62IZ7BCWT3XN","target":"record","payload":{"canonical_record":{"source":{"id":"2508.20056","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-08-27T17:13:18Z","cross_cats_sorted":[],"title_canon_sha256":"62a7565ade688dfd40aa6645b3884aaa6da8e1d12345b38f0915b61287641a76","abstract_canon_sha256":"f46236c210da455f9913b5c82c85b57525b12917fe0f9e269dbde1498868eb5f"},"schema_version":"1.0"},"canonical_sha256":"379543fa1ffcb092b7da467e115a7bbb5cd846d3e6e32580ebc4a54beb61d3f6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:00:23.441684Z","signature_b64":"2JIokPpEybyTVki9XuM24pjTFdGmplyjTNw5FSOE5aIpqxWyw3Ls1YYESEaMLKK88r/zP5+3CfvyZIYkdKKQCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"379543fa1ffcb092b7da467e115a7bbb5cd846d3e6e32580ebc4a54beb61d3f6","last_reissued_at":"2026-07-05T12:00:23.441200Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:00:23.441200Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2508.20056","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-05T12:00:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pXpcfDjG8KG0V5A4OgiCSx3whjbM72+0+75IMf1t4xuStrDjkweXCjYJo00/VIUOvc3e+NZ2QjyGuorPTCuVBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T13:04:59.066563Z"},"content_sha256":"61f507441843ac83df1412977aa2658f24ee0f6ac4eecaa795da4fcabd371c63","schema_version":"1.0","event_id":"sha256:61f507441843ac83df1412977aa2658f24ee0f6ac4eecaa795da4fcabd371c63"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:G6KUH6Q77SYJFN62IZ7BCWT3XN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Reinforcement Learning for Search Tree Size Minimization in Constraint Programming: New Results on Scheduling Benchmarks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Petr Vil\\'im, Vil\\'em Heinz, Zden\\v{e}k Hanz\\'alek","submitted_at":"2025-08-27T17:13:18Z","abstract_excerpt":"Failure-Directed Search (FDS) is a significant complete generic search algorithm used in Constraint Programming (CP) to efficiently explore the search space, proven particularly effective on scheduling problems. This paper analyzes FDS's properties, showing that minimizing the size of its search tree guided by ranked branching decisions is closely related to the Multi-armed bandit (MAB) problem. Building on this insight, MAB reinforcement learning algorithms are applied to FDS, extended with problem-specific refinements and parameter tuning, and evaluated on the two most fundamental scheduling"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.20056","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/2508.20056/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-05T12:00:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BfETmN/LGXFWoZMlF4Se/CIkf8UUin6SgYSy737cw9AucgtcP2wCbP9VJ25rRvhEZUgvwq5Rk5n3ypbRKtlqCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T13:04:59.067536Z"},"content_sha256":"3392b24364ead49493c09b5635461ef282cae2ae36816523b74b7899afd36b5c","schema_version":"1.0","event_id":"sha256:3392b24364ead49493c09b5635461ef282cae2ae36816523b74b7899afd36b5c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/G6KUH6Q77SYJFN62IZ7BCWT3XN/bundle.json","state_url":"https://pith.science/pith/G6KUH6Q77SYJFN62IZ7BCWT3XN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/G6KUH6Q77SYJFN62IZ7BCWT3XN/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-10T13:04:59Z","links":{"resolver":"https://pith.science/pith/G6KUH6Q77SYJFN62IZ7BCWT3XN","bundle":"https://pith.science/pith/G6KUH6Q77SYJFN62IZ7BCWT3XN/bundle.json","state":"https://pith.science/pith/G6KUH6Q77SYJFN62IZ7BCWT3XN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/G6KUH6Q77SYJFN62IZ7BCWT3XN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:G6KUH6Q77SYJFN62IZ7BCWT3XN","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":"f46236c210da455f9913b5c82c85b57525b12917fe0f9e269dbde1498868eb5f","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-08-27T17:13:18Z","title_canon_sha256":"62a7565ade688dfd40aa6645b3884aaa6da8e1d12345b38f0915b61287641a76"},"schema_version":"1.0","source":{"id":"2508.20056","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.20056","created_at":"2026-07-05T12:00:23Z"},{"alias_kind":"arxiv_version","alias_value":"2508.20056v1","created_at":"2026-07-05T12:00:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.20056","created_at":"2026-07-05T12:00:23Z"},{"alias_kind":"pith_short_12","alias_value":"G6KUH6Q77SYJ","created_at":"2026-07-05T12:00:23Z"},{"alias_kind":"pith_short_16","alias_value":"G6KUH6Q77SYJFN62","created_at":"2026-07-05T12:00:23Z"},{"alias_kind":"pith_short_8","alias_value":"G6KUH6Q7","created_at":"2026-07-05T12:00:23Z"}],"graph_snapshots":[{"event_id":"sha256:3392b24364ead49493c09b5635461ef282cae2ae36816523b74b7899afd36b5c","target":"graph","created_at":"2026-07-05T12:00:23Z","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/2508.20056/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Failure-Directed Search (FDS) is a significant complete generic search algorithm used in Constraint Programming (CP) to efficiently explore the search space, proven particularly effective on scheduling problems. This paper analyzes FDS's properties, showing that minimizing the size of its search tree guided by ranked branching decisions is closely related to the Multi-armed bandit (MAB) problem. Building on this insight, MAB reinforcement learning algorithms are applied to FDS, extended with problem-specific refinements and parameter tuning, and evaluated on the two most fundamental scheduling","authors_text":"Petr Vil\\'im, Vil\\'em Heinz, Zden\\v{e}k Hanz\\'alek","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-08-27T17:13:18Z","title":"Reinforcement Learning for Search Tree Size Minimization in Constraint Programming: New Results on Scheduling Benchmarks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.20056","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:61f507441843ac83df1412977aa2658f24ee0f6ac4eecaa795da4fcabd371c63","target":"record","created_at":"2026-07-05T12:00:23Z","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":"f46236c210da455f9913b5c82c85b57525b12917fe0f9e269dbde1498868eb5f","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-08-27T17:13:18Z","title_canon_sha256":"62a7565ade688dfd40aa6645b3884aaa6da8e1d12345b38f0915b61287641a76"},"schema_version":"1.0","source":{"id":"2508.20056","kind":"arxiv","version":1}},"canonical_sha256":"379543fa1ffcb092b7da467e115a7bbb5cd846d3e6e32580ebc4a54beb61d3f6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"379543fa1ffcb092b7da467e115a7bbb5cd846d3e6e32580ebc4a54beb61d3f6","first_computed_at":"2026-07-05T12:00:23.441200Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T12:00:23.441200Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2JIokPpEybyTVki9XuM24pjTFdGmplyjTNw5FSOE5aIpqxWyw3Ls1YYESEaMLKK88r/zP5+3CfvyZIYkdKKQCw==","signature_status":"signed_v1","signed_at":"2026-07-05T12:00:23.441684Z","signed_message":"canonical_sha256_bytes"},"source_id":"2508.20056","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:61f507441843ac83df1412977aa2658f24ee0f6ac4eecaa795da4fcabd371c63","sha256:3392b24364ead49493c09b5635461ef282cae2ae36816523b74b7899afd36b5c"],"state_sha256":"10c5682c1494781e642e69df54a414524b43d57d4947001f9f68c27a45c54437"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uIKPkIfTgVurD0+ave4ABvJshotY/vfQucKNAgmNGLw0p7wbbtiU8EE3USZV60PXsYVCvS/dKFMexhYxeCD3BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T13:04:59.075312Z","bundle_sha256":"a01c6aa0c76aa9e418fffa11e072182bcd5ca8e59391a2ec0837a6582eb87bcf"}}