{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:IHQF5CMI6D6YUBOHXLJ6WNXQL2","short_pith_number":"pith:IHQF5CMI","canonical_record":{"source":{"id":"1703.00900","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-02T18:55:52Z","cross_cats_sorted":[],"title_canon_sha256":"d01249be9d0a4e5ce60b192d081d187e8ad180593b4792d62a0852667b862879","abstract_canon_sha256":"89d26ef7badcf377b6845e9e8b7137a0b093d0de6c17594cfff4a3907c69740a"},"schema_version":"1.0"},"canonical_sha256":"41e05e8988f0fd8a05c7bad3eb36f05ebcaa9210b546aec0792db00a16200161","source":{"kind":"arxiv","id":"1703.00900","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.00900","created_at":"2026-05-18T00:38:32Z"},{"alias_kind":"arxiv_version","alias_value":"1703.00900v2","created_at":"2026-05-18T00:38:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.00900","created_at":"2026-05-18T00:38:32Z"},{"alias_kind":"pith_short_12","alias_value":"IHQF5CMI6D6Y","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"IHQF5CMI6D6YUBOH","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"IHQF5CMI","created_at":"2026-05-18T12:31:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:IHQF5CMI6D6YUBOHXLJ6WNXQL2","target":"record","payload":{"canonical_record":{"source":{"id":"1703.00900","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-02T18:55:52Z","cross_cats_sorted":[],"title_canon_sha256":"d01249be9d0a4e5ce60b192d081d187e8ad180593b4792d62a0852667b862879","abstract_canon_sha256":"89d26ef7badcf377b6845e9e8b7137a0b093d0de6c17594cfff4a3907c69740a"},"schema_version":"1.0"},"canonical_sha256":"41e05e8988f0fd8a05c7bad3eb36f05ebcaa9210b546aec0792db00a16200161","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:32.083119Z","signature_b64":"5dCzMrirjGLC9H9XIlThXDpLIf5ALntbXBbDQpTXkd9cWvrti0AvjafZ29X+nKzf2o2I0OGE48gQ68aCK4w3DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"41e05e8988f0fd8a05c7bad3eb36f05ebcaa9210b546aec0792db00a16200161","last_reissued_at":"2026-05-18T00:38:32.082707Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:32.082707Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.00900","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:38:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lwmPSkgJGMSOP9PV+iK7YKcV7zoRv0cTi7CSmh2Kql24v8d6I3MrUbpUwmqRIbSKnWdrvKC7SdZGISrvdAuQAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T01:36:05.119771Z"},"content_sha256":"0cd6e6a8237f7d221b13fef013cd3ea17d944a9911b3b9ca0890c973cd040990","schema_version":"1.0","event_id":"sha256:0cd6e6a8237f7d221b13fef013cd3ea17d944a9911b3b9ca0890c973cd040990"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:IHQF5CMI6D6YUBOHXLJ6WNXQL2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved Deterministic Distributed Matching via Rounding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Manuela Fischer","submitted_at":"2017-03-02T18:55:52Z","abstract_excerpt":"We present improved deterministic distributed algorithms for a number of well-studied matching problems, which are simpler, faster, more accurate, and/or more general than their known counterparts. The common denominator of these results is a deterministic distributed rounding method for certain linear programs, which is the first such rounding method, to our knowledge. A sampling of our end results is as follows.\n  -- An $O(\\log^2 \\Delta\\cdot \\log n)$-round deterministic distributed algorithm for computing a maximal matching, in $n$-node graphs with maximum degree $\\Delta$. This is the first "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.00900","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:38:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UWf2Nn0nb0Vq6lZEtHDufMeatikMT6BTZVfRZHWxHVXzOLLKnfe5Dh31cjfQ3sYY9s5M2Exh9TjcXj56h5bZDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T01:36:05.120130Z"},"content_sha256":"0eecefdc6f9e2b94956aac1310ae0acbce703b033184dc6c1c482de932322de8","schema_version":"1.0","event_id":"sha256:0eecefdc6f9e2b94956aac1310ae0acbce703b033184dc6c1c482de932322de8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IHQF5CMI6D6YUBOHXLJ6WNXQL2/bundle.json","state_url":"https://pith.science/pith/IHQF5CMI6D6YUBOHXLJ6WNXQL2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IHQF5CMI6D6YUBOHXLJ6WNXQL2/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-27T01:36:05Z","links":{"resolver":"https://pith.science/pith/IHQF5CMI6D6YUBOHXLJ6WNXQL2","bundle":"https://pith.science/pith/IHQF5CMI6D6YUBOHXLJ6WNXQL2/bundle.json","state":"https://pith.science/pith/IHQF5CMI6D6YUBOHXLJ6WNXQL2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IHQF5CMI6D6YUBOHXLJ6WNXQL2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:IHQF5CMI6D6YUBOHXLJ6WNXQL2","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":"89d26ef7badcf377b6845e9e8b7137a0b093d0de6c17594cfff4a3907c69740a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-02T18:55:52Z","title_canon_sha256":"d01249be9d0a4e5ce60b192d081d187e8ad180593b4792d62a0852667b862879"},"schema_version":"1.0","source":{"id":"1703.00900","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.00900","created_at":"2026-05-18T00:38:32Z"},{"alias_kind":"arxiv_version","alias_value":"1703.00900v2","created_at":"2026-05-18T00:38:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.00900","created_at":"2026-05-18T00:38:32Z"},{"alias_kind":"pith_short_12","alias_value":"IHQF5CMI6D6Y","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"IHQF5CMI6D6YUBOH","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"IHQF5CMI","created_at":"2026-05-18T12:31:21Z"}],"graph_snapshots":[{"event_id":"sha256:0eecefdc6f9e2b94956aac1310ae0acbce703b033184dc6c1c482de932322de8","target":"graph","created_at":"2026-05-18T00:38:32Z","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 present improved deterministic distributed algorithms for a number of well-studied matching problems, which are simpler, faster, more accurate, and/or more general than their known counterparts. The common denominator of these results is a deterministic distributed rounding method for certain linear programs, which is the first such rounding method, to our knowledge. A sampling of our end results is as follows.\n  -- An $O(\\log^2 \\Delta\\cdot \\log n)$-round deterministic distributed algorithm for computing a maximal matching, in $n$-node graphs with maximum degree $\\Delta$. This is the first ","authors_text":"Manuela Fischer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-02T18:55:52Z","title":"Improved Deterministic Distributed Matching via Rounding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.00900","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:0cd6e6a8237f7d221b13fef013cd3ea17d944a9911b3b9ca0890c973cd040990","target":"record","created_at":"2026-05-18T00:38:32Z","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":"89d26ef7badcf377b6845e9e8b7137a0b093d0de6c17594cfff4a3907c69740a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-02T18:55:52Z","title_canon_sha256":"d01249be9d0a4e5ce60b192d081d187e8ad180593b4792d62a0852667b862879"},"schema_version":"1.0","source":{"id":"1703.00900","kind":"arxiv","version":2}},"canonical_sha256":"41e05e8988f0fd8a05c7bad3eb36f05ebcaa9210b546aec0792db00a16200161","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"41e05e8988f0fd8a05c7bad3eb36f05ebcaa9210b546aec0792db00a16200161","first_computed_at":"2026-05-18T00:38:32.082707Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:38:32.082707Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5dCzMrirjGLC9H9XIlThXDpLIf5ALntbXBbDQpTXkd9cWvrti0AvjafZ29X+nKzf2o2I0OGE48gQ68aCK4w3DA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:38:32.083119Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.00900","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0cd6e6a8237f7d221b13fef013cd3ea17d944a9911b3b9ca0890c973cd040990","sha256:0eecefdc6f9e2b94956aac1310ae0acbce703b033184dc6c1c482de932322de8"],"state_sha256":"5aefcb4f5c15ecf12dafdfdf5402ef9a0a3aa04a4c63e41bf779e39538348fe1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yFaAJyRhmeFtkF5C3MIUVCvMmv7QUfURMXiYctR38HSRI2VZ4d8ALxeVAoVDGWbhbkEW4BWK1Vzaf3EDpDkMAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T01:36:05.122680Z","bundle_sha256":"1cbc9e6368d6d353bd9c576a3127be00f634d3f09f01344a362d96c251a67951"}}