{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:NS4PKKU6NGRAX7R6WOJNODVUFV","short_pith_number":"pith:NS4PKKU6","canonical_record":{"source":{"id":"2010.12813","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2020-10-24T07:16:21Z","cross_cats_sorted":[],"title_canon_sha256":"a74fb292d5a23d4292e698039a4928ab1d8deebabebf3a72e9dd7b746a79e11f","abstract_canon_sha256":"a67ba055f978cde834c3ead0e667e1965e48389ca3ad4ee2a322d24fea09562b"},"schema_version":"1.0"},"canonical_sha256":"6cb8f52a9e69a20bfe3eb392d70eb42d4d72f2709bbcd0703524a334fd68c363","source":{"kind":"arxiv","id":"2010.12813","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2010.12813","created_at":"2026-07-05T03:27:55Z"},{"alias_kind":"arxiv_version","alias_value":"2010.12813v2","created_at":"2026-07-05T03:27:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.12813","created_at":"2026-07-05T03:27:55Z"},{"alias_kind":"pith_short_12","alias_value":"NS4PKKU6NGRA","created_at":"2026-07-05T03:27:55Z"},{"alias_kind":"pith_short_16","alias_value":"NS4PKKU6NGRAX7R6","created_at":"2026-07-05T03:27:55Z"},{"alias_kind":"pith_short_8","alias_value":"NS4PKKU6","created_at":"2026-07-05T03:27:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:NS4PKKU6NGRAX7R6WOJNODVUFV","target":"record","payload":{"canonical_record":{"source":{"id":"2010.12813","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2020-10-24T07:16:21Z","cross_cats_sorted":[],"title_canon_sha256":"a74fb292d5a23d4292e698039a4928ab1d8deebabebf3a72e9dd7b746a79e11f","abstract_canon_sha256":"a67ba055f978cde834c3ead0e667e1965e48389ca3ad4ee2a322d24fea09562b"},"schema_version":"1.0"},"canonical_sha256":"6cb8f52a9e69a20bfe3eb392d70eb42d4d72f2709bbcd0703524a334fd68c363","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:27:55.432008Z","signature_b64":"R2e05ePG2ePQgohd6RYjBuCKw+9hOGoig/EwJwExEFjwNOMHK0g15+vKZcKYGdYbQvEhinvBG6C9TriGp7fjCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6cb8f52a9e69a20bfe3eb392d70eb42d4d72f2709bbcd0703524a334fd68c363","last_reissued_at":"2026-07-05T03:27:55.431596Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:27:55.431596Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2010.12813","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-07-05T03:27:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Uex/umyO3ek1JhQasrkN2MphK9FXx7/euHwrVWGpSFM3AsKnxWJb0wFXIzQ75HyCtPW7Ps2cb69sNHhrdR9iDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T19:40:05.207867Z"},"content_sha256":"17cf14d26fa873cfd12631725caf7a9359640b79f7d84deaa6999924e4b1fc74","schema_version":"1.0","event_id":"sha256:17cf14d26fa873cfd12631725caf7a9359640b79f7d84deaa6999924e4b1fc74"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:NS4PKKU6NGRAX7R6WOJNODVUFV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Constructing Taxonomies from Pretrained Language Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Catherine Chen, Dan Klein, Kevin Lin","submitted_at":"2020-10-24T07:16:21Z","abstract_excerpt":"We present a method for constructing taxonomic trees (e.g., WordNet) using pretrained language models. Our approach is composed of two modules, one that predicts parenthood relations and another that reconciles those predictions into trees. The parenthood prediction module produces likelihood scores for each potential parent-child pair, creating a graph of parent-child relation scores. The tree reconciliation module treats the task as a graph optimization problem and outputs the maximum spanning tree of this graph. We train our model on subtrees sampled from WordNet, and test on non-overlappin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.12813","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2010.12813/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-05T03:27:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"co+Wv09kqxkYjGiohD8FnNY4Xpj588k/h1YmmPtoLU3hwcXrgzIPvr0g7K37F8yrXmufCT1xg/fsu+IyhdEZAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T19:40:05.208385Z"},"content_sha256":"1bc9cafd89166cd59fdde11d4c043dacc9b4b8f31cc08d3491eb1a5c09919402","schema_version":"1.0","event_id":"sha256:1bc9cafd89166cd59fdde11d4c043dacc9b4b8f31cc08d3491eb1a5c09919402"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NS4PKKU6NGRAX7R6WOJNODVUFV/bundle.json","state_url":"https://pith.science/pith/NS4PKKU6NGRAX7R6WOJNODVUFV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NS4PKKU6NGRAX7R6WOJNODVUFV/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-18T19:40:05Z","links":{"resolver":"https://pith.science/pith/NS4PKKU6NGRAX7R6WOJNODVUFV","bundle":"https://pith.science/pith/NS4PKKU6NGRAX7R6WOJNODVUFV/bundle.json","state":"https://pith.science/pith/NS4PKKU6NGRAX7R6WOJNODVUFV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NS4PKKU6NGRAX7R6WOJNODVUFV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:NS4PKKU6NGRAX7R6WOJNODVUFV","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":"a67ba055f978cde834c3ead0e667e1965e48389ca3ad4ee2a322d24fea09562b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2020-10-24T07:16:21Z","title_canon_sha256":"a74fb292d5a23d4292e698039a4928ab1d8deebabebf3a72e9dd7b746a79e11f"},"schema_version":"1.0","source":{"id":"2010.12813","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2010.12813","created_at":"2026-07-05T03:27:55Z"},{"alias_kind":"arxiv_version","alias_value":"2010.12813v2","created_at":"2026-07-05T03:27:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.12813","created_at":"2026-07-05T03:27:55Z"},{"alias_kind":"pith_short_12","alias_value":"NS4PKKU6NGRA","created_at":"2026-07-05T03:27:55Z"},{"alias_kind":"pith_short_16","alias_value":"NS4PKKU6NGRAX7R6","created_at":"2026-07-05T03:27:55Z"},{"alias_kind":"pith_short_8","alias_value":"NS4PKKU6","created_at":"2026-07-05T03:27:55Z"}],"graph_snapshots":[{"event_id":"sha256:1bc9cafd89166cd59fdde11d4c043dacc9b4b8f31cc08d3491eb1a5c09919402","target":"graph","created_at":"2026-07-05T03:27:55Z","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/2010.12813/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We present a method for constructing taxonomic trees (e.g., WordNet) using pretrained language models. Our approach is composed of two modules, one that predicts parenthood relations and another that reconciles those predictions into trees. The parenthood prediction module produces likelihood scores for each potential parent-child pair, creating a graph of parent-child relation scores. The tree reconciliation module treats the task as a graph optimization problem and outputs the maximum spanning tree of this graph. We train our model on subtrees sampled from WordNet, and test on non-overlappin","authors_text":"Catherine Chen, Dan Klein, Kevin Lin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2020-10-24T07:16:21Z","title":"Constructing Taxonomies from Pretrained Language Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.12813","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:17cf14d26fa873cfd12631725caf7a9359640b79f7d84deaa6999924e4b1fc74","target":"record","created_at":"2026-07-05T03:27:55Z","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":"a67ba055f978cde834c3ead0e667e1965e48389ca3ad4ee2a322d24fea09562b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2020-10-24T07:16:21Z","title_canon_sha256":"a74fb292d5a23d4292e698039a4928ab1d8deebabebf3a72e9dd7b746a79e11f"},"schema_version":"1.0","source":{"id":"2010.12813","kind":"arxiv","version":2}},"canonical_sha256":"6cb8f52a9e69a20bfe3eb392d70eb42d4d72f2709bbcd0703524a334fd68c363","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6cb8f52a9e69a20bfe3eb392d70eb42d4d72f2709bbcd0703524a334fd68c363","first_computed_at":"2026-07-05T03:27:55.431596Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:27:55.431596Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"R2e05ePG2ePQgohd6RYjBuCKw+9hOGoig/EwJwExEFjwNOMHK0g15+vKZcKYGdYbQvEhinvBG6C9TriGp7fjCg==","signature_status":"signed_v1","signed_at":"2026-07-05T03:27:55.432008Z","signed_message":"canonical_sha256_bytes"},"source_id":"2010.12813","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:17cf14d26fa873cfd12631725caf7a9359640b79f7d84deaa6999924e4b1fc74","sha256:1bc9cafd89166cd59fdde11d4c043dacc9b4b8f31cc08d3491eb1a5c09919402"],"state_sha256":"2c36b7594d971a522a4557938cfdc139bab56f89c91c699708bec280d82c90f2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NdnwfTCKLZ6VJ8X4yQV0KAmrivSj+uQ4zM854RAH+PkeY6Fbo7D2v7cOODZ5/rR3UXksmCF8xqdhpEUzcxoeAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T19:40:05.213123Z","bundle_sha256":"b4d75311d5230ae9e89c83895225a5d128f9842a2df787b83c9972c89add62f3"}}