{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:SJUCWKO5MLLWZCISR5LC4E7Z5N","short_pith_number":"pith:SJUCWKO5","canonical_record":{"source":{"id":"2606.08596","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2026-06-07T12:20:32Z","cross_cats_sorted":["cs.HC"],"title_canon_sha256":"2ef285d9667c08e8b3b82f4db6ae44b325dfda9b48b067458fe3071d8befc96e","abstract_canon_sha256":"900dd47d250e1d3a919b79042b030b3615c7b366f3c1bb2065ad84d95a7f4fad"},"schema_version":"1.0"},"canonical_sha256":"92682b29dd62d76c89128f562e13f9eb480befc4493d3ee4e09b6666edf8b4f8","source":{"kind":"arxiv","id":"2606.08596","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.08596","created_at":"2026-06-09T01:05:41Z"},{"alias_kind":"arxiv_version","alias_value":"2606.08596v1","created_at":"2026-06-09T01:05:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.08596","created_at":"2026-06-09T01:05:41Z"},{"alias_kind":"pith_short_12","alias_value":"SJUCWKO5MLLW","created_at":"2026-06-09T01:05:41Z"},{"alias_kind":"pith_short_16","alias_value":"SJUCWKO5MLLWZCIS","created_at":"2026-06-09T01:05:41Z"},{"alias_kind":"pith_short_8","alias_value":"SJUCWKO5","created_at":"2026-06-09T01:05:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:SJUCWKO5MLLWZCISR5LC4E7Z5N","target":"record","payload":{"canonical_record":{"source":{"id":"2606.08596","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2026-06-07T12:20:32Z","cross_cats_sorted":["cs.HC"],"title_canon_sha256":"2ef285d9667c08e8b3b82f4db6ae44b325dfda9b48b067458fe3071d8befc96e","abstract_canon_sha256":"900dd47d250e1d3a919b79042b030b3615c7b366f3c1bb2065ad84d95a7f4fad"},"schema_version":"1.0"},"canonical_sha256":"92682b29dd62d76c89128f562e13f9eb480befc4493d3ee4e09b6666edf8b4f8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-09T01:05:41.040266Z","signature_b64":"5CcaRKIeX0I37z6mPTajDRRI82/jJea5W7nDNf3AdoVrWm0Vfp3msjEW2T5FMIq/LSnjUV/y0D4ziu+BHoVkAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"92682b29dd62d76c89128f562e13f9eb480befc4493d3ee4e09b6666edf8b4f8","last_reissued_at":"2026-06-09T01:05:41.039830Z","signature_status":"signed_v1","first_computed_at":"2026-06-09T01:05:41.039830Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.08596","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-09T01:05:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"72D7mRfVWKSs2TSX/WuyjeLBJwYGB+ylAxjb2i+quEWZ00VjUicLA4Vaq/ctzHetwivHjdhwKmFvL5YZ6QNACw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T07:16:32.792169Z"},"content_sha256":"1eacaf1e61eaaec5b7c19128f21068025305530e1295d93123725ef60d29ddcf","schema_version":"1.0","event_id":"sha256:1eacaf1e61eaaec5b7c19128f21068025305530e1295d93123725ef60d29ddcf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:SJUCWKO5MLLWZCISR5LC4E7Z5N","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distilling LLM Reasoning into an Interpretable Policy Tree for Human-AI Collaboration","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.HC"],"primary_cat":"cs.AI","authors_text":"Beiwen Zhang, Guowei Zou, Haitao Wang, Hejun Wu, Yongheng Liang","submitted_at":"2026-06-07T12:20:32Z","abstract_excerpt":"Constructing efficient and reliable policies to assist humans is indispensable for human-AI collaboration. Existing methods mainly follow two lines of work. Most prior work relies on multi-agent reinforcement learning (MARL) to learn black-box policies, which limits interpretability and raises safety concerns. Recent methods query large language models (LLMs) at each decision step, causing slow responses and high inference costs. We propose Collaboration Policy Tree (Co-pi-tree), a closed-loop method that learns an executable policy tree consisting of a partner-behavior prediction tree and an "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.08596","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.08596/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-09T01:05:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EPoDGbvR9rD7NFIaxHEtK/+Ajs9lJiGSnpcWtmJBN5I7dhTJK5FJsu3oC0LL6NfUMOemBWvftsQAxlNfbgbiBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T07:16:32.792549Z"},"content_sha256":"a2f0f50c8c34758921dd8e5555b0f618beb9f6d333d12646454568dc5c96bb50","schema_version":"1.0","event_id":"sha256:a2f0f50c8c34758921dd8e5555b0f618beb9f6d333d12646454568dc5c96bb50"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SJUCWKO5MLLWZCISR5LC4E7Z5N/bundle.json","state_url":"https://pith.science/pith/SJUCWKO5MLLWZCISR5LC4E7Z5N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SJUCWKO5MLLWZCISR5LC4E7Z5N/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-05T07:16:32Z","links":{"resolver":"https://pith.science/pith/SJUCWKO5MLLWZCISR5LC4E7Z5N","bundle":"https://pith.science/pith/SJUCWKO5MLLWZCISR5LC4E7Z5N/bundle.json","state":"https://pith.science/pith/SJUCWKO5MLLWZCISR5LC4E7Z5N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SJUCWKO5MLLWZCISR5LC4E7Z5N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:SJUCWKO5MLLWZCISR5LC4E7Z5N","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":"900dd47d250e1d3a919b79042b030b3615c7b366f3c1bb2065ad84d95a7f4fad","cross_cats_sorted":["cs.HC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2026-06-07T12:20:32Z","title_canon_sha256":"2ef285d9667c08e8b3b82f4db6ae44b325dfda9b48b067458fe3071d8befc96e"},"schema_version":"1.0","source":{"id":"2606.08596","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.08596","created_at":"2026-06-09T01:05:41Z"},{"alias_kind":"arxiv_version","alias_value":"2606.08596v1","created_at":"2026-06-09T01:05:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.08596","created_at":"2026-06-09T01:05:41Z"},{"alias_kind":"pith_short_12","alias_value":"SJUCWKO5MLLW","created_at":"2026-06-09T01:05:41Z"},{"alias_kind":"pith_short_16","alias_value":"SJUCWKO5MLLWZCIS","created_at":"2026-06-09T01:05:41Z"},{"alias_kind":"pith_short_8","alias_value":"SJUCWKO5","created_at":"2026-06-09T01:05:41Z"}],"graph_snapshots":[{"event_id":"sha256:a2f0f50c8c34758921dd8e5555b0f618beb9f6d333d12646454568dc5c96bb50","target":"graph","created_at":"2026-06-09T01:05:41Z","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.08596/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Constructing efficient and reliable policies to assist humans is indispensable for human-AI collaboration. Existing methods mainly follow two lines of work. Most prior work relies on multi-agent reinforcement learning (MARL) to learn black-box policies, which limits interpretability and raises safety concerns. Recent methods query large language models (LLMs) at each decision step, causing slow responses and high inference costs. We propose Collaboration Policy Tree (Co-pi-tree), a closed-loop method that learns an executable policy tree consisting of a partner-behavior prediction tree and an ","authors_text":"Beiwen Zhang, Guowei Zou, Haitao Wang, Hejun Wu, Yongheng Liang","cross_cats":["cs.HC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2026-06-07T12:20:32Z","title":"Distilling LLM Reasoning into an Interpretable Policy Tree for Human-AI Collaboration"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.08596","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:1eacaf1e61eaaec5b7c19128f21068025305530e1295d93123725ef60d29ddcf","target":"record","created_at":"2026-06-09T01:05:41Z","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":"900dd47d250e1d3a919b79042b030b3615c7b366f3c1bb2065ad84d95a7f4fad","cross_cats_sorted":["cs.HC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2026-06-07T12:20:32Z","title_canon_sha256":"2ef285d9667c08e8b3b82f4db6ae44b325dfda9b48b067458fe3071d8befc96e"},"schema_version":"1.0","source":{"id":"2606.08596","kind":"arxiv","version":1}},"canonical_sha256":"92682b29dd62d76c89128f562e13f9eb480befc4493d3ee4e09b6666edf8b4f8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"92682b29dd62d76c89128f562e13f9eb480befc4493d3ee4e09b6666edf8b4f8","first_computed_at":"2026-06-09T01:05:41.039830Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-09T01:05:41.039830Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5CcaRKIeX0I37z6mPTajDRRI82/jJea5W7nDNf3AdoVrWm0Vfp3msjEW2T5FMIq/LSnjUV/y0D4ziu+BHoVkAQ==","signature_status":"signed_v1","signed_at":"2026-06-09T01:05:41.040266Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.08596","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1eacaf1e61eaaec5b7c19128f21068025305530e1295d93123725ef60d29ddcf","sha256:a2f0f50c8c34758921dd8e5555b0f618beb9f6d333d12646454568dc5c96bb50"],"state_sha256":"4318a217014650e4a27d11e7d82bac17d30b6e9ed84d66b0a22ee8449307a509"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"18kMJFJAh/uBKB4GvcwYXBkI5vR9vF2IkU0xF36qgq1HBNlFRygPs+LGfteW6R3eOMkTFif4enITVy5KJxxWDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T07:16:32.796231Z","bundle_sha256":"dd772040dbd9360c83cfcdeaa5709a461d92f0cf8e7d86b6f779cbfa52ad474d"}}