{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:KD6BOESHACLLAJEGW7DKRAKD5A","short_pith_number":"pith:KD6BOESH","canonical_record":{"source":{"id":"2606.04597","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2026-06-03T08:35:04Z","cross_cats_sorted":[],"title_canon_sha256":"cec3c1a97bfd27f04e483517b5f23e713c4b0b91e7c5336448add9b26a1cd435","abstract_canon_sha256":"b844fd54a3669a2507ecb65e5bffb835b6d0c2c3c38db6d92d44961434cf75c6"},"schema_version":"1.0"},"canonical_sha256":"50fc1712470096b02486b7c6a88143e835af010e5fe439c6fe893a23bed9ce7a","source":{"kind":"arxiv","id":"2606.04597","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.04597","created_at":"2026-06-04T01:09:20Z"},{"alias_kind":"arxiv_version","alias_value":"2606.04597v1","created_at":"2026-06-04T01:09:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.04597","created_at":"2026-06-04T01:09:20Z"},{"alias_kind":"pith_short_12","alias_value":"KD6BOESHACLL","created_at":"2026-06-04T01:09:20Z"},{"alias_kind":"pith_short_16","alias_value":"KD6BOESHACLLAJEG","created_at":"2026-06-04T01:09:20Z"},{"alias_kind":"pith_short_8","alias_value":"KD6BOESH","created_at":"2026-06-04T01:09:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:KD6BOESHACLLAJEGW7DKRAKD5A","target":"record","payload":{"canonical_record":{"source":{"id":"2606.04597","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2026-06-03T08:35:04Z","cross_cats_sorted":[],"title_canon_sha256":"cec3c1a97bfd27f04e483517b5f23e713c4b0b91e7c5336448add9b26a1cd435","abstract_canon_sha256":"b844fd54a3669a2507ecb65e5bffb835b6d0c2c3c38db6d92d44961434cf75c6"},"schema_version":"1.0"},"canonical_sha256":"50fc1712470096b02486b7c6a88143e835af010e5fe439c6fe893a23bed9ce7a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-04T01:09:20.494186Z","signature_b64":"zmUhunbUwIFy9ZeFiFLtO45MpvBTCmH7FaCs2c3Y25sfc6FU3n1UMSAB/GMvtpMpiKEhiHD3K01TfYcBE7vkAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"50fc1712470096b02486b7c6a88143e835af010e5fe439c6fe893a23bed9ce7a","last_reissued_at":"2026-06-04T01:09:20.493491Z","signature_status":"signed_v1","first_computed_at":"2026-06-04T01:09:20.493491Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.04597","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-04T01:09:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4oPN/yYcNwEg2q1GC9s+n+j0WyAoKxrJKXhYiCFEQXMzoV/1int4IRkEGelY4WSqKFy1+gpfderBCto+pZgyAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T07:26:19.645585Z"},"content_sha256":"014dfedc3d402c71353cc7c970300bee61c1241a67d0b3164d1ea5f337a390d0","schema_version":"1.0","event_id":"sha256:014dfedc3d402c71353cc7c970300bee61c1241a67d0b3164d1ea5f337a390d0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:KD6BOESHACLLAJEGW7DKRAKD5A","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning Admissible Heuristics via Cost Partitioning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Hugo Barral, Marie-Jos\\'e Huguet, Quentin Cappart, Sylvie Thi\\'ebaux","submitted_at":"2026-06-03T08:35:04Z","abstract_excerpt":"Admissible heuristics are essential for optimal planning, yet learning them remains challenging due to the risk of overestimation. Cost partitioning combines multiple abstraction heuristics while preserving admissibility, but computing optimal partitions online is expensive. We propose a framework that learns to infer admissible cost partitions by leveraging the Lagrangian dual equivalence between cost partitioning and multiplier prediction. Planning states and patterns are encoded as labelled graphs, and an action-centric variant of the Weisfeiler-Leman algorithm extracts structural feature v"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.04597","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.04597/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-04T01:09:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8xRC7Fz+0YGuESEqLvGogek0KPFXn39TcXgneI52ir2Azj3dMnE294zAFN0ZfS7K4n7HaOT+dXOEMKjn/t7MCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T07:26:19.645964Z"},"content_sha256":"eca79933fef8d9b7b65c3978fe343f4d51ca32d44d8635114d821c5a93c5fc1b","schema_version":"1.0","event_id":"sha256:eca79933fef8d9b7b65c3978fe343f4d51ca32d44d8635114d821c5a93c5fc1b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KD6BOESHACLLAJEGW7DKRAKD5A/bundle.json","state_url":"https://pith.science/pith/KD6BOESHACLLAJEGW7DKRAKD5A/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KD6BOESHACLLAJEGW7DKRAKD5A/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-06-30T07:26:19Z","links":{"resolver":"https://pith.science/pith/KD6BOESHACLLAJEGW7DKRAKD5A","bundle":"https://pith.science/pith/KD6BOESHACLLAJEGW7DKRAKD5A/bundle.json","state":"https://pith.science/pith/KD6BOESHACLLAJEGW7DKRAKD5A/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KD6BOESHACLLAJEGW7DKRAKD5A/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:KD6BOESHACLLAJEGW7DKRAKD5A","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":"b844fd54a3669a2507ecb65e5bffb835b6d0c2c3c38db6d92d44961434cf75c6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2026-06-03T08:35:04Z","title_canon_sha256":"cec3c1a97bfd27f04e483517b5f23e713c4b0b91e7c5336448add9b26a1cd435"},"schema_version":"1.0","source":{"id":"2606.04597","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.04597","created_at":"2026-06-04T01:09:20Z"},{"alias_kind":"arxiv_version","alias_value":"2606.04597v1","created_at":"2026-06-04T01:09:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.04597","created_at":"2026-06-04T01:09:20Z"},{"alias_kind":"pith_short_12","alias_value":"KD6BOESHACLL","created_at":"2026-06-04T01:09:20Z"},{"alias_kind":"pith_short_16","alias_value":"KD6BOESHACLLAJEG","created_at":"2026-06-04T01:09:20Z"},{"alias_kind":"pith_short_8","alias_value":"KD6BOESH","created_at":"2026-06-04T01:09:20Z"}],"graph_snapshots":[{"event_id":"sha256:eca79933fef8d9b7b65c3978fe343f4d51ca32d44d8635114d821c5a93c5fc1b","target":"graph","created_at":"2026-06-04T01:09: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/2606.04597/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Admissible heuristics are essential for optimal planning, yet learning them remains challenging due to the risk of overestimation. Cost partitioning combines multiple abstraction heuristics while preserving admissibility, but computing optimal partitions online is expensive. We propose a framework that learns to infer admissible cost partitions by leveraging the Lagrangian dual equivalence between cost partitioning and multiplier prediction. Planning states and patterns are encoded as labelled graphs, and an action-centric variant of the Weisfeiler-Leman algorithm extracts structural feature v","authors_text":"Hugo Barral, Marie-Jos\\'e Huguet, Quentin Cappart, Sylvie Thi\\'ebaux","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2026-06-03T08:35:04Z","title":"Learning Admissible Heuristics via Cost Partitioning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.04597","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:014dfedc3d402c71353cc7c970300bee61c1241a67d0b3164d1ea5f337a390d0","target":"record","created_at":"2026-06-04T01:09: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":"b844fd54a3669a2507ecb65e5bffb835b6d0c2c3c38db6d92d44961434cf75c6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2026-06-03T08:35:04Z","title_canon_sha256":"cec3c1a97bfd27f04e483517b5f23e713c4b0b91e7c5336448add9b26a1cd435"},"schema_version":"1.0","source":{"id":"2606.04597","kind":"arxiv","version":1}},"canonical_sha256":"50fc1712470096b02486b7c6a88143e835af010e5fe439c6fe893a23bed9ce7a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"50fc1712470096b02486b7c6a88143e835af010e5fe439c6fe893a23bed9ce7a","first_computed_at":"2026-06-04T01:09:20.493491Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-04T01:09:20.493491Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zmUhunbUwIFy9ZeFiFLtO45MpvBTCmH7FaCs2c3Y25sfc6FU3n1UMSAB/GMvtpMpiKEhiHD3K01TfYcBE7vkAQ==","signature_status":"signed_v1","signed_at":"2026-06-04T01:09:20.494186Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.04597","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:014dfedc3d402c71353cc7c970300bee61c1241a67d0b3164d1ea5f337a390d0","sha256:eca79933fef8d9b7b65c3978fe343f4d51ca32d44d8635114d821c5a93c5fc1b"],"state_sha256":"ac3d3dc0613277211348cc4762f3fe77ee475b70979725bb4f92955e8e183ae9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rfFEAUor7+F8vayv9CAIpB9d7GMb207aYOX1Ry7lPslX8ho+yu6IonDsXjaP8KYH8zi2fAxFu5A4xlH9smXPBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T07:26:19.648010Z","bundle_sha256":"964a885d966acaa37d6561d7de93a18fd6d511e054db35a537790c3effaa9a41"}}