{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:E7RC5T2VBJNWMDJMTPJTFX2IPM","short_pith_number":"pith:E7RC5T2V","canonical_record":{"source":{"id":"2606.08445","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2026-06-07T04:21:23Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"298980ec5a68a92884f4182faf7405ec01d77383046b4aedf3d10b6e4eddb051","abstract_canon_sha256":"320f4afc8d9ea468a624cb2e9d05b83b8b10cc747260360870f492728595739e"},"schema_version":"1.0"},"canonical_sha256":"27e22ecf550a5b660d2c9bd332df487b01d3417fbbaf57b4b3fb6896184ad3c3","source":{"kind":"arxiv","id":"2606.08445","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.08445","created_at":"2026-06-09T01:05:36Z"},{"alias_kind":"arxiv_version","alias_value":"2606.08445v1","created_at":"2026-06-09T01:05:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.08445","created_at":"2026-06-09T01:05:36Z"},{"alias_kind":"pith_short_12","alias_value":"E7RC5T2VBJNW","created_at":"2026-06-09T01:05:36Z"},{"alias_kind":"pith_short_16","alias_value":"E7RC5T2VBJNWMDJM","created_at":"2026-06-09T01:05:36Z"},{"alias_kind":"pith_short_8","alias_value":"E7RC5T2V","created_at":"2026-06-09T01:05:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:E7RC5T2VBJNWMDJMTPJTFX2IPM","target":"record","payload":{"canonical_record":{"source":{"id":"2606.08445","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2026-06-07T04:21:23Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"298980ec5a68a92884f4182faf7405ec01d77383046b4aedf3d10b6e4eddb051","abstract_canon_sha256":"320f4afc8d9ea468a624cb2e9d05b83b8b10cc747260360870f492728595739e"},"schema_version":"1.0"},"canonical_sha256":"27e22ecf550a5b660d2c9bd332df487b01d3417fbbaf57b4b3fb6896184ad3c3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-09T01:05:36.823205Z","signature_b64":"EBnt81TO8L56LledvnqVe/4RqQV0VAJc20jfLK0XsNWwfeZkqWiMOgPGmfGzR/ZBfr/6yv4D0Irm373+40rfDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"27e22ecf550a5b660d2c9bd332df487b01d3417fbbaf57b4b3fb6896184ad3c3","last_reissued_at":"2026-06-09T01:05:36.822827Z","signature_status":"signed_v1","first_computed_at":"2026-06-09T01:05:36.822827Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.08445","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:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"os0yvAKfLLfvFDngKhujXBe7KzPxulzIwKls0HwLBcWDEh/LQt9H8sQI57buC6yMjqfxW9TSEARdeI8SvjSWAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T18:12:27.400184Z"},"content_sha256":"d2a0c1d9fda6875a463c3fcc3f87a032b3329b246e2df7c38eb8277c199e1e5f","schema_version":"1.0","event_id":"sha256:d2a0c1d9fda6875a463c3fcc3f87a032b3329b246e2df7c38eb8277c199e1e5f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:E7RC5T2VBJNWMDJMTPJTFX2IPM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Segment-level Tree Search for Long Meeting Document Summarization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Daehui Kim, Gary Geunbae Lee, Heejin Do, Jungseul Ok, Jun Seo, Sangwon Ryu, Yunsu Kim","submitted_at":"2026-06-07T04:21:23Z","abstract_excerpt":"Meeting documents are challenging to summarize due to their length and complex conversational structure. Existing approaches typically adopt multi-stage pipelines that extract information prior to summarization; however, these approaches often suffer from cumulative error propagation without intermediate validation, a limitation further amplified by short and low-quality reference summaries. We propose segment-level summarization via Monte Carlo Tree Search (S3), a training-free framework that constructs a final summary by composing segment-level summary candidates. S3 partitions a long docume"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.08445","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.08445/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:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PAF7AkNpZ0aNxWD0xWDFcNWL55kU5KGQ9kztZvaFKZ9lDP0L1VlLYCBHvUpcytUN2vkT0HILY3/n9K1FkB7bDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T18:12:27.400581Z"},"content_sha256":"e6b68d3c9b32eff47a6a2abeb19486aba10c13f3ff688c5b23b6b4d66cd6703c","schema_version":"1.0","event_id":"sha256:e6b68d3c9b32eff47a6a2abeb19486aba10c13f3ff688c5b23b6b4d66cd6703c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E7RC5T2VBJNWMDJMTPJTFX2IPM/bundle.json","state_url":"https://pith.science/pith/E7RC5T2VBJNWMDJMTPJTFX2IPM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E7RC5T2VBJNWMDJMTPJTFX2IPM/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-29T18:12:27Z","links":{"resolver":"https://pith.science/pith/E7RC5T2VBJNWMDJMTPJTFX2IPM","bundle":"https://pith.science/pith/E7RC5T2VBJNWMDJMTPJTFX2IPM/bundle.json","state":"https://pith.science/pith/E7RC5T2VBJNWMDJMTPJTFX2IPM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E7RC5T2VBJNWMDJMTPJTFX2IPM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:E7RC5T2VBJNWMDJMTPJTFX2IPM","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":"320f4afc8d9ea468a624cb2e9d05b83b8b10cc747260360870f492728595739e","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2026-06-07T04:21:23Z","title_canon_sha256":"298980ec5a68a92884f4182faf7405ec01d77383046b4aedf3d10b6e4eddb051"},"schema_version":"1.0","source":{"id":"2606.08445","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.08445","created_at":"2026-06-09T01:05:36Z"},{"alias_kind":"arxiv_version","alias_value":"2606.08445v1","created_at":"2026-06-09T01:05:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.08445","created_at":"2026-06-09T01:05:36Z"},{"alias_kind":"pith_short_12","alias_value":"E7RC5T2VBJNW","created_at":"2026-06-09T01:05:36Z"},{"alias_kind":"pith_short_16","alias_value":"E7RC5T2VBJNWMDJM","created_at":"2026-06-09T01:05:36Z"},{"alias_kind":"pith_short_8","alias_value":"E7RC5T2V","created_at":"2026-06-09T01:05:36Z"}],"graph_snapshots":[{"event_id":"sha256:e6b68d3c9b32eff47a6a2abeb19486aba10c13f3ff688c5b23b6b4d66cd6703c","target":"graph","created_at":"2026-06-09T01:05:36Z","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.08445/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Meeting documents are challenging to summarize due to their length and complex conversational structure. Existing approaches typically adopt multi-stage pipelines that extract information prior to summarization; however, these approaches often suffer from cumulative error propagation without intermediate validation, a limitation further amplified by short and low-quality reference summaries. We propose segment-level summarization via Monte Carlo Tree Search (S3), a training-free framework that constructs a final summary by composing segment-level summary candidates. S3 partitions a long docume","authors_text":"Daehui Kim, Gary Geunbae Lee, Heejin Do, Jungseul Ok, Jun Seo, Sangwon Ryu, Yunsu Kim","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2026-06-07T04:21:23Z","title":"Segment-level Tree Search for Long Meeting Document Summarization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.08445","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:d2a0c1d9fda6875a463c3fcc3f87a032b3329b246e2df7c38eb8277c199e1e5f","target":"record","created_at":"2026-06-09T01:05:36Z","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":"320f4afc8d9ea468a624cb2e9d05b83b8b10cc747260360870f492728595739e","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2026-06-07T04:21:23Z","title_canon_sha256":"298980ec5a68a92884f4182faf7405ec01d77383046b4aedf3d10b6e4eddb051"},"schema_version":"1.0","source":{"id":"2606.08445","kind":"arxiv","version":1}},"canonical_sha256":"27e22ecf550a5b660d2c9bd332df487b01d3417fbbaf57b4b3fb6896184ad3c3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"27e22ecf550a5b660d2c9bd332df487b01d3417fbbaf57b4b3fb6896184ad3c3","first_computed_at":"2026-06-09T01:05:36.822827Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-09T01:05:36.822827Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EBnt81TO8L56LledvnqVe/4RqQV0VAJc20jfLK0XsNWwfeZkqWiMOgPGmfGzR/ZBfr/6yv4D0Irm373+40rfDQ==","signature_status":"signed_v1","signed_at":"2026-06-09T01:05:36.823205Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.08445","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d2a0c1d9fda6875a463c3fcc3f87a032b3329b246e2df7c38eb8277c199e1e5f","sha256:e6b68d3c9b32eff47a6a2abeb19486aba10c13f3ff688c5b23b6b4d66cd6703c"],"state_sha256":"4c1e6cb72806de8a1ff2a3a92eea386108a7cfa50ec257f879bc982f625046a3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ogsU1BhK8wjRGOlkt548ZKtZbjIZgs2gdhMmzDn3En/f9Eo4BaSYvQTS3QwS787hqncK2AiS1VdvciIvchPLDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T18:12:27.402612Z","bundle_sha256":"3008a124c995a62e11af2c6604b6e91a1e08707fdbbaaee2b5936b12c505c02d"}}