{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:PCZMWYONWQEHL5ZIIKDP4V3LQQ","short_pith_number":"pith:PCZMWYON","schema_version":"1.0","canonical_sha256":"78b2cb61cdb40875f7284286fe576b8408ae24bf4b6f025ada2c249ee4a4bda1","source":{"kind":"arxiv","id":"1104.2315","version":3},"attestation_state":"computed","paper":{"title":"Linear Programming in the Semi-streaming Model with Application to the Maximum Matching Problem","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":"2011-04-12T19:51:47Z","abstract_excerpt":"In this paper, we study linear programming based approaches to the maximum matching problem in the semi-streaming model. The semi-streaming model has gained attention as a model for processing massive graphs as the importance of such graphs has increased. This is a model where edges are streamed-in in an adversarial order and we are allowed a space proportional to the number of vertices in a graph.\n  In recent years, there has been several new results in this semi-streaming model. However broad techniques such as linear programming have not been adapted to this model. We present several techni"},"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":"1104.2315","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-04-12T19:51:47Z","cross_cats_sorted":[],"title_canon_sha256":"f8b56ce9f370ad36cec797f3b973e71476ec1049def29d61b28e6f7ee1fa4e84","abstract_canon_sha256":"b713001486b25b048c9851471ba0ce2e6269818dff6bcd893762e010b1fb591f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:22:09.610559Z","signature_b64":"zpacS+TzyetR4aQvDRPmHGt0B19lBgFPw5wBnn3Yab5LgP/vxaK1qJOfym+/7dbwm6dKHHFpSN7HOBTpPuIoBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"78b2cb61cdb40875f7284286fe576b8408ae24bf4b6f025ada2c249ee4a4bda1","last_reissued_at":"2026-05-18T02:22:09.610023Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:22:09.610023Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Linear Programming in the Semi-streaming Model with Application to the Maximum Matching Problem","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":"2011-04-12T19:51:47Z","abstract_excerpt":"In this paper, we study linear programming based approaches to the maximum matching problem in the semi-streaming model. The semi-streaming model has gained attention as a model for processing massive graphs as the importance of such graphs has increased. This is a model where edges are streamed-in in an adversarial order and we are allowed a space proportional to the number of vertices in a graph.\n  In recent years, there has been several new results in this semi-streaming model. However broad techniques such as linear programming have not been adapted to this model. We present several techni"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.2315","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1104.2315","created_at":"2026-05-18T02:22:09.610106+00:00"},{"alias_kind":"arxiv_version","alias_value":"1104.2315v3","created_at":"2026-05-18T02:22:09.610106+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.2315","created_at":"2026-05-18T02:22:09.610106+00:00"},{"alias_kind":"pith_short_12","alias_value":"PCZMWYONWQEH","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_16","alias_value":"PCZMWYONWQEHL5ZI","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_8","alias_value":"PCZMWYON","created_at":"2026-05-18T12:26:39.201973+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/PCZMWYONWQEHL5ZIIKDP4V3LQQ","json":"https://pith.science/pith/PCZMWYONWQEHL5ZIIKDP4V3LQQ.json","graph_json":"https://pith.science/api/pith-number/PCZMWYONWQEHL5ZIIKDP4V3LQQ/graph.json","events_json":"https://pith.science/api/pith-number/PCZMWYONWQEHL5ZIIKDP4V3LQQ/events.json","paper":"https://pith.science/paper/PCZMWYON"},"agent_actions":{"view_html":"https://pith.science/pith/PCZMWYONWQEHL5ZIIKDP4V3LQQ","download_json":"https://pith.science/pith/PCZMWYONWQEHL5ZIIKDP4V3LQQ.json","view_paper":"https://pith.science/paper/PCZMWYON","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1104.2315&json=true","fetch_graph":"https://pith.science/api/pith-number/PCZMWYONWQEHL5ZIIKDP4V3LQQ/graph.json","fetch_events":"https://pith.science/api/pith-number/PCZMWYONWQEHL5ZIIKDP4V3LQQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PCZMWYONWQEHL5ZIIKDP4V3LQQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PCZMWYONWQEHL5ZIIKDP4V3LQQ/action/storage_attestation","attest_author":"https://pith.science/pith/PCZMWYONWQEHL5ZIIKDP4V3LQQ/action/author_attestation","sign_citation":"https://pith.science/pith/PCZMWYONWQEHL5ZIIKDP4V3LQQ/action/citation_signature","submit_replication":"https://pith.science/pith/PCZMWYONWQEHL5ZIIKDP4V3LQQ/action/replication_record"}},"created_at":"2026-05-18T02:22:09.610106+00:00","updated_at":"2026-05-18T02:22:09.610106+00:00"}