{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:AIJ3UGAE7OVLZTWWKDAAE2A2AK","short_pith_number":"pith:AIJ3UGAE","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"},"canonical_sha256":"0213ba1804fbaabcced650c002681a0282fbf246f51ef42e54596fe9ed6f76d3","source":{"kind":"arxiv","id":"1705.08992","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.08992","created_at":"2026-05-18T00:40:12Z"},{"alias_kind":"arxiv_version","alias_value":"1705.08992v2","created_at":"2026-05-18T00:40:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.08992","created_at":"2026-05-18T00:40:12Z"},{"alias_kind":"pith_short_12","alias_value":"AIJ3UGAE7OVL","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"AIJ3UGAE7OVLZTWW","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"AIJ3UGAE","created_at":"2026-05-18T12:31:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:AIJ3UGAE7OVLZTWWKDAAE2A2AK","target":"record","payload":{"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"},"canonical_sha256":"0213ba1804fbaabcced650c002681a0282fbf246f51ef42e54596fe9ed6f76d3","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"},"source_kind":"arxiv","source_id":"1705.08992","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-18T00:40:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rhVsUTV/NSm7zJDk23MabI05ofLPGNMl74RZYGUL94zuItbM+CvEvC2xqIhfAIHe9ix8+JPW99GRBEM2LodVDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T08:49:08.705527Z"},"content_sha256":"7c6d740214af03ad5402f44db6e34920c86af16aeecd21915eeb78d5a1e68231","schema_version":"1.0","event_id":"sha256:7c6d740214af03ad5402f44db6e34920c86af16aeecd21915eeb78d5a1e68231"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:AIJ3UGAE7OVLZTWWKDAAE2A2AK","target":"graph","payload":{"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"},"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-18T00:40:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HFYzPxVYqSoasxWSum3vhxk01VR8iCXkz/RqzEFVJJcXZHxoZtGActDJaxV20ZqtNkudTtClofIJStp/ahHMBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T08:49:08.706242Z"},"content_sha256":"774a785adff89887400a2e0f177afb6159d7c8bb3fc910b890ba3af2abe37827","schema_version":"1.0","event_id":"sha256:774a785adff89887400a2e0f177afb6159d7c8bb3fc910b890ba3af2abe37827"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AIJ3UGAE7OVLZTWWKDAAE2A2AK/bundle.json","state_url":"https://pith.science/pith/AIJ3UGAE7OVLZTWWKDAAE2A2AK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AIJ3UGAE7OVLZTWWKDAAE2A2AK/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-06T08:49:08Z","links":{"resolver":"https://pith.science/pith/AIJ3UGAE7OVLZTWWKDAAE2A2AK","bundle":"https://pith.science/pith/AIJ3UGAE7OVLZTWWKDAAE2A2AK/bundle.json","state":"https://pith.science/pith/AIJ3UGAE7OVLZTWWKDAAE2A2AK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AIJ3UGAE7OVLZTWWKDAAE2A2AK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:AIJ3UGAE7OVLZTWWKDAAE2A2AK","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":"951f606e2a72ca36981cfe55761976d04de012d209e8f7806198f927c12d8737","cross_cats_sorted":["cs.CL","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-05-24T22:53:56Z","title_canon_sha256":"9e591657b77df2754f5262b9b6a3030dc30c5f26f6d9ce3f6c19ff9bd33249a7"},"schema_version":"1.0","source":{"id":"1705.08992","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.08992","created_at":"2026-05-18T00:40:12Z"},{"alias_kind":"arxiv_version","alias_value":"1705.08992v2","created_at":"2026-05-18T00:40:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.08992","created_at":"2026-05-18T00:40:12Z"},{"alias_kind":"pith_short_12","alias_value":"AIJ3UGAE7OVL","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"AIJ3UGAE7OVLZTWW","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"AIJ3UGAE","created_at":"2026-05-18T12:31:05Z"}],"graph_snapshots":[{"event_id":"sha256:774a785adff89887400a2e0f177afb6159d7c8bb3fc910b890ba3af2abe37827","target":"graph","created_at":"2026-05-18T00:40:12Z","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":"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.","authors_text":"David Karger, Leonid Peshkin, Nicholas Harvey, Vahab Mirrokni, Virginia Savova","cross_cats":["cs.CL","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-05-24T22:53:56Z","title":"Matroids Hitting Sets and Unsupervised Dependency Grammar Induction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.08992","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:7c6d740214af03ad5402f44db6e34920c86af16aeecd21915eeb78d5a1e68231","target":"record","created_at":"2026-05-18T00:40:12Z","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":"951f606e2a72ca36981cfe55761976d04de012d209e8f7806198f927c12d8737","cross_cats_sorted":["cs.CL","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-05-24T22:53:56Z","title_canon_sha256":"9e591657b77df2754f5262b9b6a3030dc30c5f26f6d9ce3f6c19ff9bd33249a7"},"schema_version":"1.0","source":{"id":"1705.08992","kind":"arxiv","version":2}},"canonical_sha256":"0213ba1804fbaabcced650c002681a0282fbf246f51ef42e54596fe9ed6f76d3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0213ba1804fbaabcced650c002681a0282fbf246f51ef42e54596fe9ed6f76d3","first_computed_at":"2026-05-18T00:40:12.866658Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:40:12.866658Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AFRXoq+y4k177fzmrCAo00neIH8MZwZYOdl+EPKz5q2+DNryxtMfbBuphq78RqY3AgT2XPVU48zoL+VMfZ+gDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:40:12.867193Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.08992","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7c6d740214af03ad5402f44db6e34920c86af16aeecd21915eeb78d5a1e68231","sha256:774a785adff89887400a2e0f177afb6159d7c8bb3fc910b890ba3af2abe37827"],"state_sha256":"84b45fdcf7bb29fe5d3432ddb8ca97040b204e3423198b37eed782f66bdd787a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S6cqRExQVvbOrggH1GW7XU/StUHDRYBuxQsvTk6A41rKuWZStfEyfEgaKJCKB9IefB45F869dgt7b5OjLeKIBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T08:49:08.710565Z","bundle_sha256":"abe428d5e572dbf70b04f1a3c071a516d5d20c5945f1e726add2abb50903ea44"}}