{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:L46OSZ5HTIP7DA5JZL2AV3JWI3","short_pith_number":"pith:L46OSZ5H","canonical_record":{"source":{"id":"1704.01929","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-04-06T16:50:26Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"2f6ebe1a1af2e626d675af626227e252cfc78f3db71cb2310aaba95cc5f5b463","abstract_canon_sha256":"3244197520d3a27f3aa9a5180a5921558848430ae24263164c3af7a135729ef7"},"schema_version":"1.0"},"canonical_sha256":"5f3ce967a79a1ff183a9caf40aed3646dcd4af69d29f8e25f16274af998e4ffd","source":{"kind":"arxiv","id":"1704.01929","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.01929","created_at":"2026-05-18T00:05:51Z"},{"alias_kind":"arxiv_version","alias_value":"1704.01929v2","created_at":"2026-05-18T00:05:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.01929","created_at":"2026-05-18T00:05:51Z"},{"alias_kind":"pith_short_12","alias_value":"L46OSZ5HTIP7","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"L46OSZ5HTIP7DA5J","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"L46OSZ5H","created_at":"2026-05-18T12:31:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:L46OSZ5HTIP7DA5JZL2AV3JWI3","target":"record","payload":{"canonical_record":{"source":{"id":"1704.01929","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-04-06T16:50:26Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"2f6ebe1a1af2e626d675af626227e252cfc78f3db71cb2310aaba95cc5f5b463","abstract_canon_sha256":"3244197520d3a27f3aa9a5180a5921558848430ae24263164c3af7a135729ef7"},"schema_version":"1.0"},"canonical_sha256":"5f3ce967a79a1ff183a9caf40aed3646dcd4af69d29f8e25f16274af998e4ffd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:51.351042Z","signature_b64":"EKdR8E7kq4cv2dL+WFMnYgFu3i5RYyerN9kD3YoViT5Tsw46kzuboMi7uz0qSQeLahWmyoIz6ggtgio4InOYBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5f3ce967a79a1ff183a9caf40aed3646dcd4af69d29f8e25f16274af998e4ffd","last_reissued_at":"2026-05-18T00:05:51.350389Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:51.350389Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.01929","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:05:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mheJAVCl+Z6EPGtubB/dVd2rjJPN4B1bwxGItmlNKP1pdVjdjWHl0eyGv3qnXxjNGCHfqLVnh6Eo0DnOK3qqBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T12:45:01.176279Z"},"content_sha256":"4a72ed879e489f78e0fcefb8b99868c9544509ff54289156f20e7dc0e644d798","schema_version":"1.0","event_id":"sha256:4a72ed879e489f78e0fcefb8b99868c9544509ff54289156f20e7dc0e644d798"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:L46OSZ5HTIP7DA5JZL2AV3JWI3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Matching Problem in General Graphs is in Quasi-NC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CC","authors_text":"Jakub Tarnawski, Ola Svensson","submitted_at":"2017-04-06T16:50:26Z","abstract_excerpt":"We show that the perfect matching problem in general graphs is in Quasi-NC. That is, we give a deterministic parallel algorithm which runs in $O(\\log^3 n)$ time on $n^{O(\\log^2 n)}$ processors. The result is obtained by a derandomization of the Isolation Lemma for perfect matchings, which was introduced in the classic paper by Mulmuley, Vazirani and Vazirani [1987] to obtain a Randomized NC algorithm.\n  Our proof extends the framework of Fenner, Gurjar and Thierauf [2016], who proved the analogous result in the special case of bipartite graphs. Compared to that setting, several new ingredients"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.01929","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:05:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G4A9Z9lMPWglUP3lF2BrM0AH1cxpaD+5MG25S9GB5p2aqyHfHHVbYmOjc15cgEksLdGNSUk0Yr8gC/7f5axzAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T12:45:01.176646Z"},"content_sha256":"5f4890f0f097388666ae3184bcceeff3fcf5510419a101f67f78b89ff21e2057","schema_version":"1.0","event_id":"sha256:5f4890f0f097388666ae3184bcceeff3fcf5510419a101f67f78b89ff21e2057"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L46OSZ5HTIP7DA5JZL2AV3JWI3/bundle.json","state_url":"https://pith.science/pith/L46OSZ5HTIP7DA5JZL2AV3JWI3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L46OSZ5HTIP7DA5JZL2AV3JWI3/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-05T12:45:01Z","links":{"resolver":"https://pith.science/pith/L46OSZ5HTIP7DA5JZL2AV3JWI3","bundle":"https://pith.science/pith/L46OSZ5HTIP7DA5JZL2AV3JWI3/bundle.json","state":"https://pith.science/pith/L46OSZ5HTIP7DA5JZL2AV3JWI3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L46OSZ5HTIP7DA5JZL2AV3JWI3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:L46OSZ5HTIP7DA5JZL2AV3JWI3","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":"3244197520d3a27f3aa9a5180a5921558848430ae24263164c3af7a135729ef7","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-04-06T16:50:26Z","title_canon_sha256":"2f6ebe1a1af2e626d675af626227e252cfc78f3db71cb2310aaba95cc5f5b463"},"schema_version":"1.0","source":{"id":"1704.01929","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.01929","created_at":"2026-05-18T00:05:51Z"},{"alias_kind":"arxiv_version","alias_value":"1704.01929v2","created_at":"2026-05-18T00:05:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.01929","created_at":"2026-05-18T00:05:51Z"},{"alias_kind":"pith_short_12","alias_value":"L46OSZ5HTIP7","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"L46OSZ5HTIP7DA5J","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"L46OSZ5H","created_at":"2026-05-18T12:31:28Z"}],"graph_snapshots":[{"event_id":"sha256:5f4890f0f097388666ae3184bcceeff3fcf5510419a101f67f78b89ff21e2057","target":"graph","created_at":"2026-05-18T00:05:51Z","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 show that the perfect matching problem in general graphs is in Quasi-NC. That is, we give a deterministic parallel algorithm which runs in $O(\\log^3 n)$ time on $n^{O(\\log^2 n)}$ processors. The result is obtained by a derandomization of the Isolation Lemma for perfect matchings, which was introduced in the classic paper by Mulmuley, Vazirani and Vazirani [1987] to obtain a Randomized NC algorithm.\n  Our proof extends the framework of Fenner, Gurjar and Thierauf [2016], who proved the analogous result in the special case of bipartite graphs. Compared to that setting, several new ingredients","authors_text":"Jakub Tarnawski, Ola Svensson","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-04-06T16:50:26Z","title":"The Matching Problem in General Graphs is in Quasi-NC"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.01929","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:4a72ed879e489f78e0fcefb8b99868c9544509ff54289156f20e7dc0e644d798","target":"record","created_at":"2026-05-18T00:05:51Z","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":"3244197520d3a27f3aa9a5180a5921558848430ae24263164c3af7a135729ef7","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-04-06T16:50:26Z","title_canon_sha256":"2f6ebe1a1af2e626d675af626227e252cfc78f3db71cb2310aaba95cc5f5b463"},"schema_version":"1.0","source":{"id":"1704.01929","kind":"arxiv","version":2}},"canonical_sha256":"5f3ce967a79a1ff183a9caf40aed3646dcd4af69d29f8e25f16274af998e4ffd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5f3ce967a79a1ff183a9caf40aed3646dcd4af69d29f8e25f16274af998e4ffd","first_computed_at":"2026-05-18T00:05:51.350389Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:05:51.350389Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EKdR8E7kq4cv2dL+WFMnYgFu3i5RYyerN9kD3YoViT5Tsw46kzuboMi7uz0qSQeLahWmyoIz6ggtgio4InOYBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:05:51.351042Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.01929","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4a72ed879e489f78e0fcefb8b99868c9544509ff54289156f20e7dc0e644d798","sha256:5f4890f0f097388666ae3184bcceeff3fcf5510419a101f67f78b89ff21e2057"],"state_sha256":"627e221f0c50b39f186794791ff01b8f8ed45262c3d5a57610aef90b84291508"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xcd9MIRRwH6IxTZk79OJpfesZ7N0fnnI1zhL0ZOEGVum5BKmWKtbiu7pKzxTTvCc0RlS9liGNOaUk3/u4s5UCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T12:45:01.178620Z","bundle_sha256":"3fab6cc5c62031d21785268836cc87121c929e98badc66cae9045fb143e9c949"}}