{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:LM7KKWQGZXXT2SY6AIZRKEEVKT","short_pith_number":"pith:LM7KKWQG","canonical_record":{"source":{"id":"1512.06271","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-12-19T17:09:41Z","cross_cats_sorted":[],"title_canon_sha256":"a261e17fdb2de909f23a0cb1e1e5b089746c6bbf527bf84074d9f76093316fcd","abstract_canon_sha256":"760ce603de9316157f47404392f4cc85a31eb0f2cf4c647872d1be5bed56eb77"},"schema_version":"1.0"},"canonical_sha256":"5b3ea55a06cdef3d4b1e023315109554f8aeac5fd033188a55894af810f15685","source":{"kind":"arxiv","id":"1512.06271","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.06271","created_at":"2026-05-18T00:23:09Z"},{"alias_kind":"arxiv_version","alias_value":"1512.06271v4","created_at":"2026-05-18T00:23:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.06271","created_at":"2026-05-18T00:23:09Z"},{"alias_kind":"pith_short_12","alias_value":"LM7KKWQGZXXT","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LM7KKWQGZXXT2SY6","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LM7KKWQG","created_at":"2026-05-18T12:29:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:LM7KKWQGZXXT2SY6AIZRKEEVKT","target":"record","payload":{"canonical_record":{"source":{"id":"1512.06271","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-12-19T17:09:41Z","cross_cats_sorted":[],"title_canon_sha256":"a261e17fdb2de909f23a0cb1e1e5b089746c6bbf527bf84074d9f76093316fcd","abstract_canon_sha256":"760ce603de9316157f47404392f4cc85a31eb0f2cf4c647872d1be5bed56eb77"},"schema_version":"1.0"},"canonical_sha256":"5b3ea55a06cdef3d4b1e023315109554f8aeac5fd033188a55894af810f15685","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:09.606119Z","signature_b64":"VrRxbX2Wb0ml56MSUrQcvb+rNB3iPrDFJxjcPP7iu0zmXH+vNl3xQegEBP+wwlPXUZDrYStKf9KAF+1KeZ2EAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5b3ea55a06cdef3d4b1e023315109554f8aeac5fd033188a55894af810f15685","last_reissued_at":"2026-05-18T00:23:09.605399Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:09.605399Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1512.06271","source_version":4,"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-18T00:23:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u9Fff7kjy+UMI4OA5Clo2DUQ81yi3f5MitnKsHkUN85mZosKYEB2Iqi5VJe0L4O2HLUGXresUTHFg1UwXDF6BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T10:23:40.414450Z"},"content_sha256":"91759364530fbbb798310906e16b96131d25fe9f9ff83cd569e7de8c4210600e","schema_version":"1.0","event_id":"sha256:91759364530fbbb798310906e16b96131d25fe9f9ff83cd569e7de8c4210600e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:LM7KKWQGZXXT2SY6AIZRKEEVKT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Online Matroid Intersection: Beating Half for Random Arrival","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Guru Guruganesh, Sahil Singla","submitted_at":"2015-12-19T17:09:41Z","abstract_excerpt":"For two matroids $\\mathcal{M}_1$ and $\\mathcal{M}_2$ defined on the same ground set $E$, the online matroid intersection problem is to design an algorithm that constructs a large common independent set in an online fashion. The algorithm is presented with the ground set elements one-by-one in a uniformly random order. At each step, the algorithm must irrevocably decide whether to pick the element, while always maintaining a common independent set. While the natural greedy algorithm---pick an element whenever possible---is half competitive, nothing better was previously known; even for the spec"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.06271","kind":"arxiv","version":4},"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-18T00:23:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZRDQY+9UMcojlpC4RIG47/R/Uv+SifnFYyOJiiY6j4FSqY2bInUrlqPy4rgXZV9LhdJuYDWpXzvVnOduTZirCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T10:23:40.414790Z"},"content_sha256":"41b191837e48277b193747d56fd6d74f533803eac8bbae6bf9c4b71a5a366737","schema_version":"1.0","event_id":"sha256:41b191837e48277b193747d56fd6d74f533803eac8bbae6bf9c4b71a5a366737"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LM7KKWQGZXXT2SY6AIZRKEEVKT/bundle.json","state_url":"https://pith.science/pith/LM7KKWQGZXXT2SY6AIZRKEEVKT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LM7KKWQGZXXT2SY6AIZRKEEVKT/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-06-05T10:23:40Z","links":{"resolver":"https://pith.science/pith/LM7KKWQGZXXT2SY6AIZRKEEVKT","bundle":"https://pith.science/pith/LM7KKWQGZXXT2SY6AIZRKEEVKT/bundle.json","state":"https://pith.science/pith/LM7KKWQGZXXT2SY6AIZRKEEVKT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LM7KKWQGZXXT2SY6AIZRKEEVKT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:LM7KKWQGZXXT2SY6AIZRKEEVKT","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":"760ce603de9316157f47404392f4cc85a31eb0f2cf4c647872d1be5bed56eb77","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-12-19T17:09:41Z","title_canon_sha256":"a261e17fdb2de909f23a0cb1e1e5b089746c6bbf527bf84074d9f76093316fcd"},"schema_version":"1.0","source":{"id":"1512.06271","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.06271","created_at":"2026-05-18T00:23:09Z"},{"alias_kind":"arxiv_version","alias_value":"1512.06271v4","created_at":"2026-05-18T00:23:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.06271","created_at":"2026-05-18T00:23:09Z"},{"alias_kind":"pith_short_12","alias_value":"LM7KKWQGZXXT","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LM7KKWQGZXXT2SY6","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LM7KKWQG","created_at":"2026-05-18T12:29:29Z"}],"graph_snapshots":[{"event_id":"sha256:41b191837e48277b193747d56fd6d74f533803eac8bbae6bf9c4b71a5a366737","target":"graph","created_at":"2026-05-18T00:23: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":"For two matroids $\\mathcal{M}_1$ and $\\mathcal{M}_2$ defined on the same ground set $E$, the online matroid intersection problem is to design an algorithm that constructs a large common independent set in an online fashion. The algorithm is presented with the ground set elements one-by-one in a uniformly random order. At each step, the algorithm must irrevocably decide whether to pick the element, while always maintaining a common independent set. While the natural greedy algorithm---pick an element whenever possible---is half competitive, nothing better was previously known; even for the spec","authors_text":"Guru Guruganesh, Sahil Singla","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-12-19T17:09:41Z","title":"Online Matroid Intersection: Beating Half for Random Arrival"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.06271","kind":"arxiv","version":4},"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:91759364530fbbb798310906e16b96131d25fe9f9ff83cd569e7de8c4210600e","target":"record","created_at":"2026-05-18T00:23: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":"760ce603de9316157f47404392f4cc85a31eb0f2cf4c647872d1be5bed56eb77","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-12-19T17:09:41Z","title_canon_sha256":"a261e17fdb2de909f23a0cb1e1e5b089746c6bbf527bf84074d9f76093316fcd"},"schema_version":"1.0","source":{"id":"1512.06271","kind":"arxiv","version":4}},"canonical_sha256":"5b3ea55a06cdef3d4b1e023315109554f8aeac5fd033188a55894af810f15685","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5b3ea55a06cdef3d4b1e023315109554f8aeac5fd033188a55894af810f15685","first_computed_at":"2026-05-18T00:23:09.605399Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:23:09.605399Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VrRxbX2Wb0ml56MSUrQcvb+rNB3iPrDFJxjcPP7iu0zmXH+vNl3xQegEBP+wwlPXUZDrYStKf9KAF+1KeZ2EAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:23:09.606119Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.06271","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:91759364530fbbb798310906e16b96131d25fe9f9ff83cd569e7de8c4210600e","sha256:41b191837e48277b193747d56fd6d74f533803eac8bbae6bf9c4b71a5a366737"],"state_sha256":"b253dde545912cd66657bdb54bba8573c7807e1118df1a38367abc95733a79b7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PTWiSwN+qJvZaLvvmInWCQfUMDbjdMqEA6PGV/bZHe12KIMwOpFSldK8EUvlcJfLyI717EA/xBOljI1PFbz+CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T10:23:40.416778Z","bundle_sha256":"0c7682ad1b2f4684c353066d8c7b23e90a1e46c74ce4e124b13772ff581aff91"}}