{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:AIJ3UGAE7OVLZTWWKDAAE2A2AK","short_pith_number":"pith:AIJ3UGAE","schema_version":"1.0","canonical_sha256":"0213ba1804fbaabcced650c002681a0282fbf246f51ef42e54596fe9ed6f76d3","source":{"kind":"arxiv","id":"1705.08992","version":2},"attestation_state":"computed","paper":{"title":"Matroids Hitting Sets and Unsupervised Dependency Grammar Induction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL","cs.DS"],"primary_cat":"cs.DM","authors_text":"David Karger, Leonid Peshkin, Nicholas Harvey, Vahab Mirrokni, Virginia Savova","submitted_at":"2017-05-24T22:53:56Z","abstract_excerpt":"This paper formulates a novel problem on graphs: find the minimal subset of edges in a fully connected graph, such that the resulting graph contains all spanning trees for a set of specifed sub-graphs. This formulation is motivated by an un-supervised grammar induction problem from computational linguistics. We present a reduction to some known problems and algorithms from graph theory, provide computational complexity results, and describe an approximation algorithm."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1705.08992","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-05-24T22:53:56Z","cross_cats_sorted":["cs.CL","cs.DS"],"title_canon_sha256":"9e591657b77df2754f5262b9b6a3030dc30c5f26f6d9ce3f6c19ff9bd33249a7","abstract_canon_sha256":"951f606e2a72ca36981cfe55761976d04de012d209e8f7806198f927c12d8737"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:12.867193Z","signature_b64":"AFRXoq+y4k177fzmrCAo00neIH8MZwZYOdl+EPKz5q2+DNryxtMfbBuphq78RqY3AgT2XPVU48zoL+VMfZ+gDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0213ba1804fbaabcced650c002681a0282fbf246f51ef42e54596fe9ed6f76d3","last_reissued_at":"2026-05-18T00:40:12.866658Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:12.866658Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Matroids Hitting Sets and Unsupervised Dependency Grammar Induction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL","cs.DS"],"primary_cat":"cs.DM","authors_text":"David Karger, Leonid Peshkin, Nicholas Harvey, Vahab Mirrokni, Virginia Savova","submitted_at":"2017-05-24T22:53:56Z","abstract_excerpt":"This paper formulates a novel problem on graphs: find the minimal subset of edges in a fully connected graph, such that the resulting graph contains all spanning trees for a set of specifed sub-graphs. This formulation is motivated by an un-supervised grammar induction problem from computational linguistics. We present a reduction to some known problems and algorithms from graph theory, provide computational complexity results, and describe an approximation algorithm."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.08992","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1705.08992","created_at":"2026-05-18T00:40:12.866752+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.08992v2","created_at":"2026-05-18T00:40:12.866752+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.08992","created_at":"2026-05-18T00:40:12.866752+00:00"},{"alias_kind":"pith_short_12","alias_value":"AIJ3UGAE7OVL","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"AIJ3UGAE7OVLZTWW","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"AIJ3UGAE","created_at":"2026-05-18T12:31:05.417338+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AIJ3UGAE7OVLZTWWKDAAE2A2AK","json":"https://pith.science/pith/AIJ3UGAE7OVLZTWWKDAAE2A2AK.json","graph_json":"https://pith.science/api/pith-number/AIJ3UGAE7OVLZTWWKDAAE2A2AK/graph.json","events_json":"https://pith.science/api/pith-number/AIJ3UGAE7OVLZTWWKDAAE2A2AK/events.json","paper":"https://pith.science/paper/AIJ3UGAE"},"agent_actions":{"view_html":"https://pith.science/pith/AIJ3UGAE7OVLZTWWKDAAE2A2AK","download_json":"https://pith.science/pith/AIJ3UGAE7OVLZTWWKDAAE2A2AK.json","view_paper":"https://pith.science/paper/AIJ3UGAE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.08992&json=true","fetch_graph":"https://pith.science/api/pith-number/AIJ3UGAE7OVLZTWWKDAAE2A2AK/graph.json","fetch_events":"https://pith.science/api/pith-number/AIJ3UGAE7OVLZTWWKDAAE2A2AK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AIJ3UGAE7OVLZTWWKDAAE2A2AK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AIJ3UGAE7OVLZTWWKDAAE2A2AK/action/storage_attestation","attest_author":"https://pith.science/pith/AIJ3UGAE7OVLZTWWKDAAE2A2AK/action/author_attestation","sign_citation":"https://pith.science/pith/AIJ3UGAE7OVLZTWWKDAAE2A2AK/action/citation_signature","submit_replication":"https://pith.science/pith/AIJ3UGAE7OVLZTWWKDAAE2A2AK/action/replication_record"}},"created_at":"2026-05-18T00:40:12.866752+00:00","updated_at":"2026-05-18T00:40:12.866752+00:00"}