{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:IW3B75RJC4GAREHKRBPLV5PTH4","short_pith_number":"pith:IW3B75RJ","canonical_record":{"source":{"id":"2606.01255","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2026-05-31T14:18:18Z","cross_cats_sorted":[],"title_canon_sha256":"8798b6ce0be6dfcb2854c8b5b2935242bda8ac504a104ee14e44d0ee596a93d6","abstract_canon_sha256":"d8467921293cb049c048e8e042941ba202890a8fc73637cb702ac80bc34ee646"},"schema_version":"1.0"},"canonical_sha256":"45b61ff629170c0890ea885ebaf5f33f1d02d4877aa0ba62ebf5c753691aca89","source":{"kind":"arxiv","id":"2606.01255","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.01255","created_at":"2026-06-02T02:04:28Z"},{"alias_kind":"arxiv_version","alias_value":"2606.01255v1","created_at":"2026-06-02T02:04:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.01255","created_at":"2026-06-02T02:04:28Z"},{"alias_kind":"pith_short_12","alias_value":"IW3B75RJC4GA","created_at":"2026-06-02T02:04:28Z"},{"alias_kind":"pith_short_16","alias_value":"IW3B75RJC4GAREHK","created_at":"2026-06-02T02:04:28Z"},{"alias_kind":"pith_short_8","alias_value":"IW3B75RJ","created_at":"2026-06-02T02:04:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:IW3B75RJC4GAREHKRBPLV5PTH4","target":"record","payload":{"canonical_record":{"source":{"id":"2606.01255","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2026-05-31T14:18:18Z","cross_cats_sorted":[],"title_canon_sha256":"8798b6ce0be6dfcb2854c8b5b2935242bda8ac504a104ee14e44d0ee596a93d6","abstract_canon_sha256":"d8467921293cb049c048e8e042941ba202890a8fc73637cb702ac80bc34ee646"},"schema_version":"1.0"},"canonical_sha256":"45b61ff629170c0890ea885ebaf5f33f1d02d4877aa0ba62ebf5c753691aca89","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-02T02:04:28.068625Z","signature_b64":"BeOY2KF2jRlq7UPKu/ESew51OkaaS+1SK/XVmkOiJwvSO75MKynaONgBvK1iD269EUOD0AyM4KAK6chPf4bBDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"45b61ff629170c0890ea885ebaf5f33f1d02d4877aa0ba62ebf5c753691aca89","last_reissued_at":"2026-06-02T02:04:28.068205Z","signature_status":"signed_v1","first_computed_at":"2026-06-02T02:04:28.068205Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.01255","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-02T02:04:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7NglfKi5TJSj4d+gTXZt9jBPehvOhiUSgoQ4NUg5/pUopbTRhMyyvjw4su/9Bc86jy1qmRH+bIBtfjWpRIJPCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T12:40:43.492481Z"},"content_sha256":"d1f11bb2e43e71679fb3d9e54082b7c3b1d700a11119b5871be55de9f6696cde","schema_version":"1.0","event_id":"sha256:d1f11bb2e43e71679fb3d9e54082b7c3b1d700a11119b5871be55de9f6696cde"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:IW3B75RJC4GAREHKRBPLV5PTH4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Agentic Clustering: Controllable Text Taxonomies via Multi-Agent Refinement","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Emily Silcock, Simon L\\\"owe","submitted_at":"2026-05-31T14:18:18Z","abstract_excerpt":"Recent text-clustering methods use large language models to propose a cluster taxonomy from a corpus and then assign each text to it. These pipelines are fundamentally programmatic: the sequence of LLM calls and the rules for stopping, merging, and splitting clusters are fixed in code in advance, so they generalise poorly across corpora of different structure and cannot easily incorporate user-supplied constraints such as a target cluster count or a clustering intent. We propose an agentic alternative in which an orchestrator LLM inspects the state of the discovery process at each step and dis"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.01255","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.01255/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-02T02:04:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ww+Jztg3NDqLrRrS9j9rIx2oLson9STAP2Y6WhDKE4c4yZW2ToBG4jvKFUpMSR5B0qD35SYW2Bo75gVZirz2Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T12:40:43.492866Z"},"content_sha256":"55f34528440babb9484c928d242ec8d8ae32516bb35a35aa12b3d2f9c5e3945e","schema_version":"1.0","event_id":"sha256:55f34528440babb9484c928d242ec8d8ae32516bb35a35aa12b3d2f9c5e3945e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IW3B75RJC4GAREHKRBPLV5PTH4/bundle.json","state_url":"https://pith.science/pith/IW3B75RJC4GAREHKRBPLV5PTH4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IW3B75RJC4GAREHKRBPLV5PTH4/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-29T12:40:43Z","links":{"resolver":"https://pith.science/pith/IW3B75RJC4GAREHKRBPLV5PTH4","bundle":"https://pith.science/pith/IW3B75RJC4GAREHKRBPLV5PTH4/bundle.json","state":"https://pith.science/pith/IW3B75RJC4GAREHKRBPLV5PTH4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IW3B75RJC4GAREHKRBPLV5PTH4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:IW3B75RJC4GAREHKRBPLV5PTH4","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":"d8467921293cb049c048e8e042941ba202890a8fc73637cb702ac80bc34ee646","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2026-05-31T14:18:18Z","title_canon_sha256":"8798b6ce0be6dfcb2854c8b5b2935242bda8ac504a104ee14e44d0ee596a93d6"},"schema_version":"1.0","source":{"id":"2606.01255","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.01255","created_at":"2026-06-02T02:04:28Z"},{"alias_kind":"arxiv_version","alias_value":"2606.01255v1","created_at":"2026-06-02T02:04:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.01255","created_at":"2026-06-02T02:04:28Z"},{"alias_kind":"pith_short_12","alias_value":"IW3B75RJC4GA","created_at":"2026-06-02T02:04:28Z"},{"alias_kind":"pith_short_16","alias_value":"IW3B75RJC4GAREHK","created_at":"2026-06-02T02:04:28Z"},{"alias_kind":"pith_short_8","alias_value":"IW3B75RJ","created_at":"2026-06-02T02:04:28Z"}],"graph_snapshots":[{"event_id":"sha256:55f34528440babb9484c928d242ec8d8ae32516bb35a35aa12b3d2f9c5e3945e","target":"graph","created_at":"2026-06-02T02:04:28Z","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.01255/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Recent text-clustering methods use large language models to propose a cluster taxonomy from a corpus and then assign each text to it. These pipelines are fundamentally programmatic: the sequence of LLM calls and the rules for stopping, merging, and splitting clusters are fixed in code in advance, so they generalise poorly across corpora of different structure and cannot easily incorporate user-supplied constraints such as a target cluster count or a clustering intent. We propose an agentic alternative in which an orchestrator LLM inspects the state of the discovery process at each step and dis","authors_text":"Emily Silcock, Simon L\\\"owe","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2026-05-31T14:18:18Z","title":"Agentic Clustering: Controllable Text Taxonomies via Multi-Agent Refinement"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.01255","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:d1f11bb2e43e71679fb3d9e54082b7c3b1d700a11119b5871be55de9f6696cde","target":"record","created_at":"2026-06-02T02:04:28Z","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":"d8467921293cb049c048e8e042941ba202890a8fc73637cb702ac80bc34ee646","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2026-05-31T14:18:18Z","title_canon_sha256":"8798b6ce0be6dfcb2854c8b5b2935242bda8ac504a104ee14e44d0ee596a93d6"},"schema_version":"1.0","source":{"id":"2606.01255","kind":"arxiv","version":1}},"canonical_sha256":"45b61ff629170c0890ea885ebaf5f33f1d02d4877aa0ba62ebf5c753691aca89","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"45b61ff629170c0890ea885ebaf5f33f1d02d4877aa0ba62ebf5c753691aca89","first_computed_at":"2026-06-02T02:04:28.068205Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-02T02:04:28.068205Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BeOY2KF2jRlq7UPKu/ESew51OkaaS+1SK/XVmkOiJwvSO75MKynaONgBvK1iD269EUOD0AyM4KAK6chPf4bBDQ==","signature_status":"signed_v1","signed_at":"2026-06-02T02:04:28.068625Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.01255","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d1f11bb2e43e71679fb3d9e54082b7c3b1d700a11119b5871be55de9f6696cde","sha256:55f34528440babb9484c928d242ec8d8ae32516bb35a35aa12b3d2f9c5e3945e"],"state_sha256":"ec0e3ab2967fa52727dd5a60c1219c7c87723dcc20d9e4923603432e14dac723"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wZLfEOrXopM8EywxhC9ajIT2nVXFOYP9WLoTuNEnt6eWfaF3ptVjIfHRFwfT1fpPxnf/SqAHlCmleRPGnDIgCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T12:40:43.494848Z","bundle_sha256":"8878ef609a931844412c13cf7801635d85bf1a61de9e1bb5e899459b4c345c91"}}