{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:KDBRD6SDEJ4O3VLOEOHXJCYUBD","short_pith_number":"pith:KDBRD6SD","canonical_record":{"source":{"id":"1307.1718","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2013-07-05T21:05:20Z","cross_cats_sorted":[],"title_canon_sha256":"985260867fb5ffa8ed3b074db976cc7f1f7b003ac1cd206a0d8667b76bfc9e83","abstract_canon_sha256":"c6554780c5ed86f81c31bf31f6879879a246dc28139c4c20c14f61becb64e485"},"schema_version":"1.0"},"canonical_sha256":"50c311fa432278edd56e238f748b1408c596fb365161aeef8c30315da74b914d","source":{"kind":"arxiv","id":"1307.1718","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.1718","created_at":"2026-05-18T02:52:58Z"},{"alias_kind":"arxiv_version","alias_value":"1307.1718v2","created_at":"2026-05-18T02:52:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.1718","created_at":"2026-05-18T02:52:58Z"},{"alias_kind":"pith_short_12","alias_value":"KDBRD6SDEJ4O","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"KDBRD6SDEJ4O3VLO","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"KDBRD6SD","created_at":"2026-05-18T12:27:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:KDBRD6SDEJ4O3VLOEOHXJCYUBD","target":"record","payload":{"canonical_record":{"source":{"id":"1307.1718","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2013-07-05T21:05:20Z","cross_cats_sorted":[],"title_canon_sha256":"985260867fb5ffa8ed3b074db976cc7f1f7b003ac1cd206a0d8667b76bfc9e83","abstract_canon_sha256":"c6554780c5ed86f81c31bf31f6879879a246dc28139c4c20c14f61becb64e485"},"schema_version":"1.0"},"canonical_sha256":"50c311fa432278edd56e238f748b1408c596fb365161aeef8c30315da74b914d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:52:58.437620Z","signature_b64":"4hZ9Cw6OAl9slY4OcS1PIYcSJ6Gya/DY7fS0KODCrVJ6CblDMmQNmiOc1u/HCrWHkCdD8F/poNa7KI9MnWXSBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"50c311fa432278edd56e238f748b1408c596fb365161aeef8c30315da74b914d","last_reissued_at":"2026-05-18T02:52:58.437091Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:52:58.437091Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1307.1718","source_version":2,"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-05-18T02:52:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TzqIJY1C1yLbUGsvna+LF2WZR4n/pAl+NWwJprTEmhep027Vkmc1hyGPqxmzXicrhaWls/zdOqII7uXqS/onAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T21:03:44.919649Z"},"content_sha256":"e754a23bf23690757b271a445d0bc59a0775629d3c2b43ad7ec5da92c3d976fc","schema_version":"1.0","event_id":"sha256:e754a23bf23690757b271a445d0bc59a0775629d3c2b43ad7ec5da92c3d976fc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:KDBRD6SDEJ4O3VLOEOHXJCYUBD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graph-based Approach to Automatic Taxonomy Generation (GraBTax)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"C. Lee Giles, Madian Khabsa, Pucktada Treeratpituk","submitted_at":"2013-07-05T21:05:20Z","abstract_excerpt":"We propose a novel graph-based approach for constructing concept hierarchy from a large text corpus. Our algorithm, GraBTax, incorporates both statistical co-occurrences and lexical similarity in optimizing the structure of the taxonomy. To automatically generate topic-dependent taxonomies from a large text corpus, GraBTax first extracts topical terms and their relationships from the corpus. The algorithm then constructs a weighted graph representing topics and their associations. A graph partitioning algorithm is then used to recursively partition the topic graph into a taxonomy. For evaluati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.1718","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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-05-18T02:52:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R3XFQpTVfyVNx3+MaXd/h7c/QgBOCBCbpSUx7Y+xh9qWrZbB8InM7SWQx8v1RD8jYAJGjfS05ozlOgqzeQ4YBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T21:03:44.920374Z"},"content_sha256":"57c74bd28069b27c085f46036647d6a312edacf6dd99792f0e336354e5ab3cd2","schema_version":"1.0","event_id":"sha256:57c74bd28069b27c085f46036647d6a312edacf6dd99792f0e336354e5ab3cd2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KDBRD6SDEJ4O3VLOEOHXJCYUBD/bundle.json","state_url":"https://pith.science/pith/KDBRD6SDEJ4O3VLOEOHXJCYUBD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KDBRD6SDEJ4O3VLOEOHXJCYUBD/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-05-24T21:03:44Z","links":{"resolver":"https://pith.science/pith/KDBRD6SDEJ4O3VLOEOHXJCYUBD","bundle":"https://pith.science/pith/KDBRD6SDEJ4O3VLOEOHXJCYUBD/bundle.json","state":"https://pith.science/pith/KDBRD6SDEJ4O3VLOEOHXJCYUBD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KDBRD6SDEJ4O3VLOEOHXJCYUBD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:KDBRD6SDEJ4O3VLOEOHXJCYUBD","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":"c6554780c5ed86f81c31bf31f6879879a246dc28139c4c20c14f61becb64e485","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2013-07-05T21:05:20Z","title_canon_sha256":"985260867fb5ffa8ed3b074db976cc7f1f7b003ac1cd206a0d8667b76bfc9e83"},"schema_version":"1.0","source":{"id":"1307.1718","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.1718","created_at":"2026-05-18T02:52:58Z"},{"alias_kind":"arxiv_version","alias_value":"1307.1718v2","created_at":"2026-05-18T02:52:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.1718","created_at":"2026-05-18T02:52:58Z"},{"alias_kind":"pith_short_12","alias_value":"KDBRD6SDEJ4O","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"KDBRD6SDEJ4O3VLO","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"KDBRD6SD","created_at":"2026-05-18T12:27:49Z"}],"graph_snapshots":[{"event_id":"sha256:57c74bd28069b27c085f46036647d6a312edacf6dd99792f0e336354e5ab3cd2","target":"graph","created_at":"2026-05-18T02:52:58Z","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"},"paper":{"abstract_excerpt":"We propose a novel graph-based approach for constructing concept hierarchy from a large text corpus. Our algorithm, GraBTax, incorporates both statistical co-occurrences and lexical similarity in optimizing the structure of the taxonomy. To automatically generate topic-dependent taxonomies from a large text corpus, GraBTax first extracts topical terms and their relationships from the corpus. The algorithm then constructs a weighted graph representing topics and their associations. A graph partitioning algorithm is then used to recursively partition the topic graph into a taxonomy. For evaluati","authors_text":"C. Lee Giles, Madian Khabsa, Pucktada Treeratpituk","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2013-07-05T21:05:20Z","title":"Graph-based Approach to Automatic Taxonomy Generation (GraBTax)"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.1718","kind":"arxiv","version":2},"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:e754a23bf23690757b271a445d0bc59a0775629d3c2b43ad7ec5da92c3d976fc","target":"record","created_at":"2026-05-18T02:52:58Z","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":"c6554780c5ed86f81c31bf31f6879879a246dc28139c4c20c14f61becb64e485","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2013-07-05T21:05:20Z","title_canon_sha256":"985260867fb5ffa8ed3b074db976cc7f1f7b003ac1cd206a0d8667b76bfc9e83"},"schema_version":"1.0","source":{"id":"1307.1718","kind":"arxiv","version":2}},"canonical_sha256":"50c311fa432278edd56e238f748b1408c596fb365161aeef8c30315da74b914d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"50c311fa432278edd56e238f748b1408c596fb365161aeef8c30315da74b914d","first_computed_at":"2026-05-18T02:52:58.437091Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:52:58.437091Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4hZ9Cw6OAl9slY4OcS1PIYcSJ6Gya/DY7fS0KODCrVJ6CblDMmQNmiOc1u/HCrWHkCdD8F/poNa7KI9MnWXSBw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:52:58.437620Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.1718","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e754a23bf23690757b271a445d0bc59a0775629d3c2b43ad7ec5da92c3d976fc","sha256:57c74bd28069b27c085f46036647d6a312edacf6dd99792f0e336354e5ab3cd2"],"state_sha256":"0a3e53049a97bfb1a79c63438a26d605e846f0dad3ac450c121246098a0d7f22"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y7ymTuMgW/1G1TFA4seuoOBWY4LGX53d0j3yKcfPI/ITdgI83iW+0FqHQgDu/EOJdHyvkw66Z+xtgO1NE4D5AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T21:03:44.923994Z","bundle_sha256":"4a3eb209151223cc46087d35c122410bfb293dbd2a363d3ac725611c43ad0d81"}}