{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:QECKB3LXWQBJTSCMPBRIY6BEQP","short_pith_number":"pith:QECKB3LX","canonical_record":{"source":{"id":"2506.01669","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-06-02T13:38:55Z","cross_cats_sorted":[],"title_canon_sha256":"3b439e98b3a4365ed9fc5695085f98c8c4ef94452bcced670780f61bb0cc4a04","abstract_canon_sha256":"71fe30974f4447d5decb3ebcfc465f51e9b01b74aad6638aa7e58b1088b28124"},"schema_version":"1.0"},"canonical_sha256":"8104a0ed77b40299c84c78628c782483eb60efec5a1b8fd175e1ad6df7bd6316","source":{"kind":"arxiv","id":"2506.01669","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.01669","created_at":"2026-07-05T11:14:17Z"},{"alias_kind":"arxiv_version","alias_value":"2506.01669v1","created_at":"2026-07-05T11:14:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.01669","created_at":"2026-07-05T11:14:17Z"},{"alias_kind":"pith_short_12","alias_value":"QECKB3LXWQBJ","created_at":"2026-07-05T11:14:17Z"},{"alias_kind":"pith_short_16","alias_value":"QECKB3LXWQBJTSCM","created_at":"2026-07-05T11:14:17Z"},{"alias_kind":"pith_short_8","alias_value":"QECKB3LX","created_at":"2026-07-05T11:14:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:QECKB3LXWQBJTSCMPBRIY6BEQP","target":"record","payload":{"canonical_record":{"source":{"id":"2506.01669","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-06-02T13:38:55Z","cross_cats_sorted":[],"title_canon_sha256":"3b439e98b3a4365ed9fc5695085f98c8c4ef94452bcced670780f61bb0cc4a04","abstract_canon_sha256":"71fe30974f4447d5decb3ebcfc465f51e9b01b74aad6638aa7e58b1088b28124"},"schema_version":"1.0"},"canonical_sha256":"8104a0ed77b40299c84c78628c782483eb60efec5a1b8fd175e1ad6df7bd6316","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:14:17.520923Z","signature_b64":"Uhks0WM096u63RVras1rQrqoDssNRLytF8+JeiGTYDkpXj8lWHM7vtOcklzDQzVGdFh8lrdjYlNgr1la2Tk+DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8104a0ed77b40299c84c78628c782483eb60efec5a1b8fd175e1ad6df7bd6316","last_reissued_at":"2026-07-05T11:14:17.520472Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:14:17.520472Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2506.01669","source_version":1,"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-05T11:14:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PtVmxwKfQhNbsMn+Q7slyUOXVMNOiADgKB9HIH8GqxM8J+aCqZ7EXb84oazdbbdUkvrDGZRZqh0pw2KJchRpDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T07:42:14.589154Z"},"content_sha256":"c9b958aa1921e336936425f8b430b5dc3f52e2e7cb736517511fc5ac329e506b","schema_version":"1.0","event_id":"sha256:c9b958aa1921e336936425f8b430b5dc3f52e2e7cb736517511fc5ac329e506b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:QECKB3LXWQBJTSCMPBRIY6BEQP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A 0.51-Approximation of Maximum Matching in Sublinear $n^{1.5}$ Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jakub Tarnawski, Mohammad Roghani, Sepideh Mahabadi","submitted_at":"2025-06-02T13:38:55Z","abstract_excerpt":"We study the problem of estimating the size of a maximum matching in sublinear time. The problem has been studied extensively in the literature and various algorithms and lower bounds are known for it. Our result is a $0.5109$-approximation algorithm with a running time of $\\tilde{O}(n\\sqrt{n})$.\n  All previous algorithms either provide only a marginal improvement (e.g., $2^{-280}$) over the $0.5$-approximation that arises from estimating a \\emph{maximal} matching, or have a running time that is nearly $n^2$. Our approach is also arguably much simpler than other algorithms beating $0.5$-approx"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.01669","kind":"arxiv","version":1},"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/2506.01669/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-05T11:14:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LGgQHNMhq7DW66eNpNWhkEeiI37y/7hbvCzmrzQ3Oq+GSxZ6B+HhPbLdNlYIFCSHebags5GsbPcpvxdgfFtACw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T07:42:14.589674Z"},"content_sha256":"803665c0e428885057e3093f0296eef4004475f7d16aaff64de06ef47bbda7c4","schema_version":"1.0","event_id":"sha256:803665c0e428885057e3093f0296eef4004475f7d16aaff64de06ef47bbda7c4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QECKB3LXWQBJTSCMPBRIY6BEQP/bundle.json","state_url":"https://pith.science/pith/QECKB3LXWQBJTSCMPBRIY6BEQP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QECKB3LXWQBJTSCMPBRIY6BEQP/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-08T07:42:14Z","links":{"resolver":"https://pith.science/pith/QECKB3LXWQBJTSCMPBRIY6BEQP","bundle":"https://pith.science/pith/QECKB3LXWQBJTSCMPBRIY6BEQP/bundle.json","state":"https://pith.science/pith/QECKB3LXWQBJTSCMPBRIY6BEQP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QECKB3LXWQBJTSCMPBRIY6BEQP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:QECKB3LXWQBJTSCMPBRIY6BEQP","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":"71fe30974f4447d5decb3ebcfc465f51e9b01b74aad6638aa7e58b1088b28124","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-06-02T13:38:55Z","title_canon_sha256":"3b439e98b3a4365ed9fc5695085f98c8c4ef94452bcced670780f61bb0cc4a04"},"schema_version":"1.0","source":{"id":"2506.01669","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.01669","created_at":"2026-07-05T11:14:17Z"},{"alias_kind":"arxiv_version","alias_value":"2506.01669v1","created_at":"2026-07-05T11:14:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.01669","created_at":"2026-07-05T11:14:17Z"},{"alias_kind":"pith_short_12","alias_value":"QECKB3LXWQBJ","created_at":"2026-07-05T11:14:17Z"},{"alias_kind":"pith_short_16","alias_value":"QECKB3LXWQBJTSCM","created_at":"2026-07-05T11:14:17Z"},{"alias_kind":"pith_short_8","alias_value":"QECKB3LX","created_at":"2026-07-05T11:14:17Z"}],"graph_snapshots":[{"event_id":"sha256:803665c0e428885057e3093f0296eef4004475f7d16aaff64de06ef47bbda7c4","target":"graph","created_at":"2026-07-05T11:14:17Z","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/2506.01669/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the problem of estimating the size of a maximum matching in sublinear time. The problem has been studied extensively in the literature and various algorithms and lower bounds are known for it. Our result is a $0.5109$-approximation algorithm with a running time of $\\tilde{O}(n\\sqrt{n})$.\n  All previous algorithms either provide only a marginal improvement (e.g., $2^{-280}$) over the $0.5$-approximation that arises from estimating a \\emph{maximal} matching, or have a running time that is nearly $n^2$. Our approach is also arguably much simpler than other algorithms beating $0.5$-approx","authors_text":"Jakub Tarnawski, Mohammad Roghani, Sepideh Mahabadi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-06-02T13:38:55Z","title":"A 0.51-Approximation of Maximum Matching in Sublinear $n^{1.5}$ Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.01669","kind":"arxiv","version":1},"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:c9b958aa1921e336936425f8b430b5dc3f52e2e7cb736517511fc5ac329e506b","target":"record","created_at":"2026-07-05T11:14:17Z","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":"71fe30974f4447d5decb3ebcfc465f51e9b01b74aad6638aa7e58b1088b28124","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-06-02T13:38:55Z","title_canon_sha256":"3b439e98b3a4365ed9fc5695085f98c8c4ef94452bcced670780f61bb0cc4a04"},"schema_version":"1.0","source":{"id":"2506.01669","kind":"arxiv","version":1}},"canonical_sha256":"8104a0ed77b40299c84c78628c782483eb60efec5a1b8fd175e1ad6df7bd6316","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8104a0ed77b40299c84c78628c782483eb60efec5a1b8fd175e1ad6df7bd6316","first_computed_at":"2026-07-05T11:14:17.520472Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:14:17.520472Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Uhks0WM096u63RVras1rQrqoDssNRLytF8+JeiGTYDkpXj8lWHM7vtOcklzDQzVGdFh8lrdjYlNgr1la2Tk+DQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:14:17.520923Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.01669","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c9b958aa1921e336936425f8b430b5dc3f52e2e7cb736517511fc5ac329e506b","sha256:803665c0e428885057e3093f0296eef4004475f7d16aaff64de06ef47bbda7c4"],"state_sha256":"6e7e71f193bdc61d5244b943aa64757b67e2e5759759f2fe0cf00d776ca7911c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N23JUaQf7STqz6ARyqdxP3E9PThX0nszxaYhtD5BrcRLBpUpyXQwzuIRkkttNWi4iqouEgq093+6iMajr/DTAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T07:42:14.594012Z","bundle_sha256":"53195186e9f66d9180100b53403bcd1b1e40ff964c54e69c56161389470293f4"}}