{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:NQ5TWFL2PSFOH7VZHLXBFZSFMK","short_pith_number":"pith:NQ5TWFL2","canonical_record":{"source":{"id":"1307.4359","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-16T17:48:49Z","cross_cats_sorted":[],"title_canon_sha256":"dcbd9a3dc0330993bf8ce081fa0c7336c41f92eec32ef6a4783730e40773d372","abstract_canon_sha256":"38fec092ea57c144ce2b4a23d31e45fb2d61a752304fa808c478c4b7bb01e449"},"schema_version":"1.0"},"canonical_sha256":"6c3b3b157a7c8ae3feb93aee12e64562925f6aad67ddfc66dd64951c1cb6b12f","source":{"kind":"arxiv","id":"1307.4359","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.4359","created_at":"2026-05-18T02:18:23Z"},{"alias_kind":"arxiv_version","alias_value":"1307.4359v3","created_at":"2026-05-18T02:18:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.4359","created_at":"2026-05-18T02:18:23Z"},{"alias_kind":"pith_short_12","alias_value":"NQ5TWFL2PSFO","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"NQ5TWFL2PSFOH7VZ","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"NQ5TWFL2","created_at":"2026-05-18T12:27:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:NQ5TWFL2PSFOH7VZHLXBFZSFMK","target":"record","payload":{"canonical_record":{"source":{"id":"1307.4359","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-16T17:48:49Z","cross_cats_sorted":[],"title_canon_sha256":"dcbd9a3dc0330993bf8ce081fa0c7336c41f92eec32ef6a4783730e40773d372","abstract_canon_sha256":"38fec092ea57c144ce2b4a23d31e45fb2d61a752304fa808c478c4b7bb01e449"},"schema_version":"1.0"},"canonical_sha256":"6c3b3b157a7c8ae3feb93aee12e64562925f6aad67ddfc66dd64951c1cb6b12f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:18:23.997146Z","signature_b64":"uAYJP10sOw27uDygvJBYqN9BPsE+AcnCvOfSPCWh9SJYtKCcXVGhHtukSfVAOM2GtQ7BEFLQL2mTMDrZzSwVDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6c3b3b157a7c8ae3feb93aee12e64562925f6aad67ddfc66dd64951c1cb6b12f","last_reissued_at":"2026-05-18T02:18:23.996628Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:18:23.996628Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1307.4359","source_version":3,"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-18T02:18:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ou5UmqBfQm8fMeHzyG6q93/CTL52lKWj+rxJ2xCauTnwTHOQIHrdnRkWF7DJcw58FtcXmDpKMfypJYUPRkMzBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T05:45:10.398263Z"},"content_sha256":"dc178ef3d9200b7f59296a9a4e3074a1b1ea41bef515642b5ca0a0ce20f8a6b0","schema_version":"1.0","event_id":"sha256:dc178ef3d9200b7f59296a9a4e3074a1b1ea41bef515642b5ca0a0ce20f8a6b0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:NQ5TWFL2PSFOH7VZHLXBFZSFMK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Access to Data and Number of Iterations: Dual Primal Algorithms for Maximum Matching under Resource Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Kook Jin Ahn, Sudipto Guha","submitted_at":"2013-07-16T17:48:49Z","abstract_excerpt":"In this paper we consider graph algorithms in models of computation where the space usage (random accessible storage, in addition to the read only input) is sublinear in the number of edges $m$ and the access to input data is constrained. These questions arises in many natural settings, and in particular in the analysis of MapReduce or similar algorithms that model constrained parallelism with sublinear central processing. In SPAA 2011, Lattanzi etal. provided a $O(1)$ approximation of maximum matching using $O(p)$ rounds of iterative filtering via mapreduce and $O(n^{1+1/p})$ space of central"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.4359","kind":"arxiv","version":3},"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-18T02:18:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KJbOXkWdTKKKfYP4tj/+JCocEi5DGyDHvC/EkQqUUBC9jjZoik7hEeFswNFDqBOitZJ3R7Png2rJejxa8VuzBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T05:45:10.398631Z"},"content_sha256":"b810e89884b95bdcf7869682072899a7500ad4a788627d5689c0c76113fcfd03","schema_version":"1.0","event_id":"sha256:b810e89884b95bdcf7869682072899a7500ad4a788627d5689c0c76113fcfd03"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NQ5TWFL2PSFOH7VZHLXBFZSFMK/bundle.json","state_url":"https://pith.science/pith/NQ5TWFL2PSFOH7VZHLXBFZSFMK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NQ5TWFL2PSFOH7VZHLXBFZSFMK/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-28T05:45:10Z","links":{"resolver":"https://pith.science/pith/NQ5TWFL2PSFOH7VZHLXBFZSFMK","bundle":"https://pith.science/pith/NQ5TWFL2PSFOH7VZHLXBFZSFMK/bundle.json","state":"https://pith.science/pith/NQ5TWFL2PSFOH7VZHLXBFZSFMK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NQ5TWFL2PSFOH7VZHLXBFZSFMK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:NQ5TWFL2PSFOH7VZHLXBFZSFMK","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":"38fec092ea57c144ce2b4a23d31e45fb2d61a752304fa808c478c4b7bb01e449","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-16T17:48:49Z","title_canon_sha256":"dcbd9a3dc0330993bf8ce081fa0c7336c41f92eec32ef6a4783730e40773d372"},"schema_version":"1.0","source":{"id":"1307.4359","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.4359","created_at":"2026-05-18T02:18:23Z"},{"alias_kind":"arxiv_version","alias_value":"1307.4359v3","created_at":"2026-05-18T02:18:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.4359","created_at":"2026-05-18T02:18:23Z"},{"alias_kind":"pith_short_12","alias_value":"NQ5TWFL2PSFO","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"NQ5TWFL2PSFOH7VZ","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"NQ5TWFL2","created_at":"2026-05-18T12:27:52Z"}],"graph_snapshots":[{"event_id":"sha256:b810e89884b95bdcf7869682072899a7500ad4a788627d5689c0c76113fcfd03","target":"graph","created_at":"2026-05-18T02:18:23Z","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":"In this paper we consider graph algorithms in models of computation where the space usage (random accessible storage, in addition to the read only input) is sublinear in the number of edges $m$ and the access to input data is constrained. These questions arises in many natural settings, and in particular in the analysis of MapReduce or similar algorithms that model constrained parallelism with sublinear central processing. In SPAA 2011, Lattanzi etal. provided a $O(1)$ approximation of maximum matching using $O(p)$ rounds of iterative filtering via mapreduce and $O(n^{1+1/p})$ space of central","authors_text":"Kook Jin Ahn, Sudipto Guha","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-16T17:48:49Z","title":"Access to Data and Number of Iterations: Dual Primal Algorithms for Maximum Matching under Resource Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.4359","kind":"arxiv","version":3},"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:dc178ef3d9200b7f59296a9a4e3074a1b1ea41bef515642b5ca0a0ce20f8a6b0","target":"record","created_at":"2026-05-18T02:18:23Z","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":"38fec092ea57c144ce2b4a23d31e45fb2d61a752304fa808c478c4b7bb01e449","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-16T17:48:49Z","title_canon_sha256":"dcbd9a3dc0330993bf8ce081fa0c7336c41f92eec32ef6a4783730e40773d372"},"schema_version":"1.0","source":{"id":"1307.4359","kind":"arxiv","version":3}},"canonical_sha256":"6c3b3b157a7c8ae3feb93aee12e64562925f6aad67ddfc66dd64951c1cb6b12f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6c3b3b157a7c8ae3feb93aee12e64562925f6aad67ddfc66dd64951c1cb6b12f","first_computed_at":"2026-05-18T02:18:23.996628Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:18:23.996628Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uAYJP10sOw27uDygvJBYqN9BPsE+AcnCvOfSPCWh9SJYtKCcXVGhHtukSfVAOM2GtQ7BEFLQL2mTMDrZzSwVDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:18:23.997146Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.4359","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dc178ef3d9200b7f59296a9a4e3074a1b1ea41bef515642b5ca0a0ce20f8a6b0","sha256:b810e89884b95bdcf7869682072899a7500ad4a788627d5689c0c76113fcfd03"],"state_sha256":"2d3db47753bec06ff237c08cfd8d0622e1588e4cc0fbcf7f051cd1efff923b2e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sYY4ML5Mc4XHpJ9N0/ARA8VggU08z48qSNRCh1Bnnv+cAq6ONL9jfd7SNV2QiX4MUtKfJXSoE/1977pMJSTqDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T05:45:10.400718Z","bundle_sha256":"9a5f5e99d92adde926a32bc06ad52071ddd0b5894581d0de085ab971ddc32fa7"}}