{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:UFDWYYFD7S5264KC76EIEE4MS5","short_pith_number":"pith:UFDWYYFD","schema_version":"1.0","canonical_sha256":"a1476c60a3fcbbaf7142ff8882138c976fdc2db7312022cde458ec6a9e91bacd","source":{"kind":"arxiv","id":"1309.2038","version":2},"attestation_state":"computed","paper":{"title":"Submodular Maximization Meets Streaming: Matchings, Matroids, and More","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Amit Chakrabarti, Sagar Kale","submitted_at":"2013-09-09T03:53:48Z","abstract_excerpt":"We study the problem of finding a maximum matching in a graph given by an input stream listing its edges in some arbitrary order, where the quantity to be maximized is given by a monotone submodular function on subsets of edges. This problem, which we call maximum submodular-function matching (MSM), is a natural generalization of maximum weight matching (MWM), which is in turn a generalization of maximum cardinality matching (MCM). We give two incomparable algorithms for this problem with space usage falling in the semi-streaming range---they store only $O(n)$ edges, using $O(n\\log n)$ working"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1309.2038","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-09-09T03:53:48Z","cross_cats_sorted":[],"title_canon_sha256":"743156b2419cfca9ca79004f2bd2ec70637f7f1a0d13721d5d912518a2395fd4","abstract_canon_sha256":"9cab94a3523816e652af6e55bddf4248a1cd6d75b6df58f6f807b743374c9479"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:06:54.439518Z","signature_b64":"ewyBnBiBIAcVeNq8XJOG2mErdxSRqMbatSherPYqGsAJgsI/hcEwHBcji2yJ870ceHp7K6AIYT/WDkhzmGezDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a1476c60a3fcbbaf7142ff8882138c976fdc2db7312022cde458ec6a9e91bacd","last_reissued_at":"2026-05-18T03:06:54.438929Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:06:54.438929Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Submodular Maximization Meets Streaming: Matchings, Matroids, and More","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Amit Chakrabarti, Sagar Kale","submitted_at":"2013-09-09T03:53:48Z","abstract_excerpt":"We study the problem of finding a maximum matching in a graph given by an input stream listing its edges in some arbitrary order, where the quantity to be maximized is given by a monotone submodular function on subsets of edges. This problem, which we call maximum submodular-function matching (MSM), is a natural generalization of maximum weight matching (MWM), which is in turn a generalization of maximum cardinality matching (MCM). We give two incomparable algorithms for this problem with space usage falling in the semi-streaming range---they store only $O(n)$ edges, using $O(n\\log n)$ working"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.2038","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1309.2038","created_at":"2026-05-18T03:06:54.439016+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.2038v2","created_at":"2026-05-18T03:06:54.439016+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.2038","created_at":"2026-05-18T03:06:54.439016+00:00"},{"alias_kind":"pith_short_12","alias_value":"UFDWYYFD7S52","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_16","alias_value":"UFDWYYFD7S5264KC","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_8","alias_value":"UFDWYYFD","created_at":"2026-05-18T12:28:02.375192+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UFDWYYFD7S5264KC76EIEE4MS5","json":"https://pith.science/pith/UFDWYYFD7S5264KC76EIEE4MS5.json","graph_json":"https://pith.science/api/pith-number/UFDWYYFD7S5264KC76EIEE4MS5/graph.json","events_json":"https://pith.science/api/pith-number/UFDWYYFD7S5264KC76EIEE4MS5/events.json","paper":"https://pith.science/paper/UFDWYYFD"},"agent_actions":{"view_html":"https://pith.science/pith/UFDWYYFD7S5264KC76EIEE4MS5","download_json":"https://pith.science/pith/UFDWYYFD7S5264KC76EIEE4MS5.json","view_paper":"https://pith.science/paper/UFDWYYFD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.2038&json=true","fetch_graph":"https://pith.science/api/pith-number/UFDWYYFD7S5264KC76EIEE4MS5/graph.json","fetch_events":"https://pith.science/api/pith-number/UFDWYYFD7S5264KC76EIEE4MS5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UFDWYYFD7S5264KC76EIEE4MS5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UFDWYYFD7S5264KC76EIEE4MS5/action/storage_attestation","attest_author":"https://pith.science/pith/UFDWYYFD7S5264KC76EIEE4MS5/action/author_attestation","sign_citation":"https://pith.science/pith/UFDWYYFD7S5264KC76EIEE4MS5/action/citation_signature","submit_replication":"https://pith.science/pith/UFDWYYFD7S5264KC76EIEE4MS5/action/replication_record"}},"created_at":"2026-05-18T03:06:54.439016+00:00","updated_at":"2026-05-18T03:06:54.439016+00:00"}