{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:PCZMWYONWQEHL5ZIIKDP4V3LQQ","short_pith_number":"pith:PCZMWYON","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"},"canonical_sha256":"78b2cb61cdb40875f7284286fe576b8408ae24bf4b6f025ada2c249ee4a4bda1","source":{"kind":"arxiv","id":"1104.2315","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.2315","created_at":"2026-05-18T02:22:09Z"},{"alias_kind":"arxiv_version","alias_value":"1104.2315v3","created_at":"2026-05-18T02:22:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.2315","created_at":"2026-05-18T02:22:09Z"},{"alias_kind":"pith_short_12","alias_value":"PCZMWYONWQEH","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"PCZMWYONWQEHL5ZI","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"PCZMWYON","created_at":"2026-05-18T12:26:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:PCZMWYONWQEHL5ZIIKDP4V3LQQ","target":"record","payload":{"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"},"canonical_sha256":"78b2cb61cdb40875f7284286fe576b8408ae24bf4b6f025ada2c249ee4a4bda1","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"},"source_kind":"arxiv","source_id":"1104.2315","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:22:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ks1VNgh0UAtWTCVpwL5lHf4m5h415ZUEXQRrFHyDn3MGbN2BEXSYr0fCbdVcngKys5476CRqhikM5K6fqzqgDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T04:29:35.151781Z"},"content_sha256":"1df4a7c0e29efd38b8f4b736caf298fbd6c7fc7a0be61b789426210734039144","schema_version":"1.0","event_id":"sha256:1df4a7c0e29efd38b8f4b736caf298fbd6c7fc7a0be61b789426210734039144"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:PCZMWYONWQEHL5ZIIKDP4V3LQQ","target":"graph","payload":{"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"},"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:22:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"on5PWAprpepYddQfiZM4eiVOQ+606vsASvjLRE+LUe5aWwgD6O6SLndH8W5K9JVqyxZDHrQiIUZ+LQx1XxxoBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T04:29:35.152133Z"},"content_sha256":"5769a857db837b9d71c5bea4eff43e28b830c48cd2dd2617785b3bca63063d80","schema_version":"1.0","event_id":"sha256:5769a857db837b9d71c5bea4eff43e28b830c48cd2dd2617785b3bca63063d80"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PCZMWYONWQEHL5ZIIKDP4V3LQQ/bundle.json","state_url":"https://pith.science/pith/PCZMWYONWQEHL5ZIIKDP4V3LQQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PCZMWYONWQEHL5ZIIKDP4V3LQQ/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-28T04:29:35Z","links":{"resolver":"https://pith.science/pith/PCZMWYONWQEHL5ZIIKDP4V3LQQ","bundle":"https://pith.science/pith/PCZMWYONWQEHL5ZIIKDP4V3LQQ/bundle.json","state":"https://pith.science/pith/PCZMWYONWQEHL5ZIIKDP4V3LQQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PCZMWYONWQEHL5ZIIKDP4V3LQQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:PCZMWYONWQEHL5ZIIKDP4V3LQQ","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":"b713001486b25b048c9851471ba0ce2e6269818dff6bcd893762e010b1fb591f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-04-12T19:51:47Z","title_canon_sha256":"f8b56ce9f370ad36cec797f3b973e71476ec1049def29d61b28e6f7ee1fa4e84"},"schema_version":"1.0","source":{"id":"1104.2315","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.2315","created_at":"2026-05-18T02:22:09Z"},{"alias_kind":"arxiv_version","alias_value":"1104.2315v3","created_at":"2026-05-18T02:22:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.2315","created_at":"2026-05-18T02:22:09Z"},{"alias_kind":"pith_short_12","alias_value":"PCZMWYONWQEH","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"PCZMWYONWQEHL5ZI","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"PCZMWYON","created_at":"2026-05-18T12:26:39Z"}],"graph_snapshots":[{"event_id":"sha256:5769a857db837b9d71c5bea4eff43e28b830c48cd2dd2617785b3bca63063d80","target":"graph","created_at":"2026-05-18T02:22:09Z","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 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","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":"2011-04-12T19:51:47Z","title":"Linear Programming in the Semi-streaming Model with Application to the Maximum Matching Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.2315","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:1df4a7c0e29efd38b8f4b736caf298fbd6c7fc7a0be61b789426210734039144","target":"record","created_at":"2026-05-18T02:22:09Z","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":"b713001486b25b048c9851471ba0ce2e6269818dff6bcd893762e010b1fb591f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-04-12T19:51:47Z","title_canon_sha256":"f8b56ce9f370ad36cec797f3b973e71476ec1049def29d61b28e6f7ee1fa4e84"},"schema_version":"1.0","source":{"id":"1104.2315","kind":"arxiv","version":3}},"canonical_sha256":"78b2cb61cdb40875f7284286fe576b8408ae24bf4b6f025ada2c249ee4a4bda1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"78b2cb61cdb40875f7284286fe576b8408ae24bf4b6f025ada2c249ee4a4bda1","first_computed_at":"2026-05-18T02:22:09.610023Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:22:09.610023Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zpacS+TzyetR4aQvDRPmHGt0B19lBgFPw5wBnn3Yab5LgP/vxaK1qJOfym+/7dbwm6dKHHFpSN7HOBTpPuIoBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:22:09.610559Z","signed_message":"canonical_sha256_bytes"},"source_id":"1104.2315","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1df4a7c0e29efd38b8f4b736caf298fbd6c7fc7a0be61b789426210734039144","sha256:5769a857db837b9d71c5bea4eff43e28b830c48cd2dd2617785b3bca63063d80"],"state_sha256":"eabaacaee20cb8e29d34254871e664386848f72e25ec9216574b86d01f3c9f07"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YJZl3uwWunfrt39jl74bcMYAEXH+39rlYm+/QPZWC3XbQhYMzne2MMGTRMCjYDaUTTLOVaCqotw7kzes7PuSAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T04:29:35.154090Z","bundle_sha256":"41b86041f915c11e4dfeb2893b12efb324d8bdbf0e78d2fbbfc45acfaa7c36df"}}