{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:SB2KXECAFM3PDRHHWUZ7DSD5TB","short_pith_number":"pith:SB2KXECA","canonical_record":{"source":{"id":"2601.09097","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.AI","submitted_at":"2026-01-14T02:58:07Z","cross_cats_sorted":[],"title_canon_sha256":"aa8c253b84a7bd04ed9c572ded301b05c1579844fa151572d862d3c2298524be","abstract_canon_sha256":"6a7f7d33a1ffa9e549d7a6b7c5afe68adaf13ad25c5097339f95058cbae78cd3"},"schema_version":"1.0"},"canonical_sha256":"9074ab90402b36f1c4e7b533f1c87d986e3c342ae3a20b8e10aa0b5e0b33da79","source":{"kind":"arxiv","id":"2601.09097","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2601.09097","created_at":"2026-07-07T01:16:03Z"},{"alias_kind":"arxiv_version","alias_value":"2601.09097v3","created_at":"2026-07-07T01:16:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2601.09097","created_at":"2026-07-07T01:16:03Z"},{"alias_kind":"pith_short_12","alias_value":"SB2KXECAFM3P","created_at":"2026-07-07T01:16:03Z"},{"alias_kind":"pith_short_16","alias_value":"SB2KXECAFM3PDRHH","created_at":"2026-07-07T01:16:03Z"},{"alias_kind":"pith_short_8","alias_value":"SB2KXECA","created_at":"2026-07-07T01:16:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:SB2KXECAFM3PDRHHWUZ7DSD5TB","target":"record","payload":{"canonical_record":{"source":{"id":"2601.09097","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.AI","submitted_at":"2026-01-14T02:58:07Z","cross_cats_sorted":[],"title_canon_sha256":"aa8c253b84a7bd04ed9c572ded301b05c1579844fa151572d862d3c2298524be","abstract_canon_sha256":"6a7f7d33a1ffa9e549d7a6b7c5afe68adaf13ad25c5097339f95058cbae78cd3"},"schema_version":"1.0"},"canonical_sha256":"9074ab90402b36f1c4e7b533f1c87d986e3c342ae3a20b8e10aa0b5e0b33da79","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-07T01:16:03.811724Z","signature_b64":"SLCEWAHvC4cq9M4kTjPoBuqkKIUD/LYTf2PTj3gfU5fJ/pb76o4I2O153kI1BZrXkDEJCt5oQT+xGpM39ZCKAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9074ab90402b36f1c4e7b533f1c87d986e3c342ae3a20b8e10aa0b5e0b33da79","last_reissued_at":"2026-07-07T01:16:03.810648Z","signature_status":"signed_v1","first_computed_at":"2026-07-07T01:16:03.810648Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2601.09097","source_version":3,"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-07T01:16:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NUW/E/aZLWnfiyC6pZqxw6tFNlYOKR3WALYjM2/skAIAIH+ZM0xf4q40gG/h4n5HeZA7suFTZohes75/VJ98AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T22:05:10.586602Z"},"content_sha256":"a085431b81857369754b05ecc43bb88625f153da256842d8a3f33df67cd3823f","schema_version":"1.0","event_id":"sha256:a085431b81857369754b05ecc43bb88625f153da256842d8a3f33df67cd3823f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:SB2KXECAFM3PDRHHWUZ7DSD5TB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Programming over Thinking: Efficient and Robust Multi-Constraint Planning","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Derrick Goh Xin Deik, Nancy F. Chen, Quanyu Long, Wenya Wang, Zhengyuan Liu","submitted_at":"2026-01-14T02:58:07Z","abstract_excerpt":"Multi-constraint planning involves identifying, evaluating, and refining candidate plans while satisfying multiple, potentially conflicting constraints. Existing large language model (LLM) approaches face fundamental limitations in this domain. Pure reasoning paradigms, which rely on long natural language chains, are prone to inconsistency, error accumulation, and prohibitive cost as constraints compound. Conversely, LLMs combined with coding- or solver-based strategies lack flexibility: they often generate problem-specific code from scratch or depend on fixed solvers, failing to capture gener"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2601.09097","kind":"arxiv","version":3},"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/2601.09097/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-07T01:16:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ocMbJTJnhuifUe5xxP+MxOj1HAx+ECnhja/TcahvQyBie980HUeqsd5OhmzM71bSap89ed/MMbq3QyUqrPnlDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T22:05:10.587252Z"},"content_sha256":"3f6c87e5e204bad81ea0fd4cbdf7ad5833daf55ee6fb56eb139c82caeae8ed54","schema_version":"1.0","event_id":"sha256:3f6c87e5e204bad81ea0fd4cbdf7ad5833daf55ee6fb56eb139c82caeae8ed54"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SB2KXECAFM3PDRHHWUZ7DSD5TB/bundle.json","state_url":"https://pith.science/pith/SB2KXECAFM3PDRHHWUZ7DSD5TB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SB2KXECAFM3PDRHHWUZ7DSD5TB/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-03T22:05:10Z","links":{"resolver":"https://pith.science/pith/SB2KXECAFM3PDRHHWUZ7DSD5TB","bundle":"https://pith.science/pith/SB2KXECAFM3PDRHHWUZ7DSD5TB/bundle.json","state":"https://pith.science/pith/SB2KXECAFM3PDRHHWUZ7DSD5TB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SB2KXECAFM3PDRHHWUZ7DSD5TB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:SB2KXECAFM3PDRHHWUZ7DSD5TB","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":"6a7f7d33a1ffa9e549d7a6b7c5afe68adaf13ad25c5097339f95058cbae78cd3","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.AI","submitted_at":"2026-01-14T02:58:07Z","title_canon_sha256":"aa8c253b84a7bd04ed9c572ded301b05c1579844fa151572d862d3c2298524be"},"schema_version":"1.0","source":{"id":"2601.09097","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2601.09097","created_at":"2026-07-07T01:16:03Z"},{"alias_kind":"arxiv_version","alias_value":"2601.09097v3","created_at":"2026-07-07T01:16:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2601.09097","created_at":"2026-07-07T01:16:03Z"},{"alias_kind":"pith_short_12","alias_value":"SB2KXECAFM3P","created_at":"2026-07-07T01:16:03Z"},{"alias_kind":"pith_short_16","alias_value":"SB2KXECAFM3PDRHH","created_at":"2026-07-07T01:16:03Z"},{"alias_kind":"pith_short_8","alias_value":"SB2KXECA","created_at":"2026-07-07T01:16:03Z"}],"graph_snapshots":[{"event_id":"sha256:3f6c87e5e204bad81ea0fd4cbdf7ad5833daf55ee6fb56eb139c82caeae8ed54","target":"graph","created_at":"2026-07-07T01:16:03Z","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/2601.09097/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Multi-constraint planning involves identifying, evaluating, and refining candidate plans while satisfying multiple, potentially conflicting constraints. Existing large language model (LLM) approaches face fundamental limitations in this domain. Pure reasoning paradigms, which rely on long natural language chains, are prone to inconsistency, error accumulation, and prohibitive cost as constraints compound. Conversely, LLMs combined with coding- or solver-based strategies lack flexibility: they often generate problem-specific code from scratch or depend on fixed solvers, failing to capture gener","authors_text":"Derrick Goh Xin Deik, Nancy F. Chen, Quanyu Long, Wenya Wang, Zhengyuan Liu","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.AI","submitted_at":"2026-01-14T02:58:07Z","title":"Programming over Thinking: Efficient and Robust Multi-Constraint Planning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2601.09097","kind":"arxiv","version":3},"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:a085431b81857369754b05ecc43bb88625f153da256842d8a3f33df67cd3823f","target":"record","created_at":"2026-07-07T01:16:03Z","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":"6a7f7d33a1ffa9e549d7a6b7c5afe68adaf13ad25c5097339f95058cbae78cd3","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.AI","submitted_at":"2026-01-14T02:58:07Z","title_canon_sha256":"aa8c253b84a7bd04ed9c572ded301b05c1579844fa151572d862d3c2298524be"},"schema_version":"1.0","source":{"id":"2601.09097","kind":"arxiv","version":3}},"canonical_sha256":"9074ab90402b36f1c4e7b533f1c87d986e3c342ae3a20b8e10aa0b5e0b33da79","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9074ab90402b36f1c4e7b533f1c87d986e3c342ae3a20b8e10aa0b5e0b33da79","first_computed_at":"2026-07-07T01:16:03.810648Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-07T01:16:03.810648Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SLCEWAHvC4cq9M4kTjPoBuqkKIUD/LYTf2PTj3gfU5fJ/pb76o4I2O153kI1BZrXkDEJCt5oQT+xGpM39ZCKAw==","signature_status":"signed_v1","signed_at":"2026-07-07T01:16:03.811724Z","signed_message":"canonical_sha256_bytes"},"source_id":"2601.09097","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a085431b81857369754b05ecc43bb88625f153da256842d8a3f33df67cd3823f","sha256:3f6c87e5e204bad81ea0fd4cbdf7ad5833daf55ee6fb56eb139c82caeae8ed54"],"state_sha256":"c1412d8f0ebc119d1c2e6e69a04f9f917d89d9de63a831880b9ad9de20460f35"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pEg/gr7PTWweEbMvDRQAJvi7Kl9vq6LPdlEhOddu9M/B5NNCXChEoVEWLh90pT9DJHxJpDaf7K4pTWTmC/eBDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T22:05:10.594266Z","bundle_sha256":"51d7b73f6a27c2877dc57f635a27e45e92568cc8335c9c7adb181fc254e51a5c"}}