{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:HQZGRYO3ANX6CGP7WWCGBUMKUT","short_pith_number":"pith:HQZGRYO3","canonical_record":{"source":{"id":"1207.5146","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-21T14:36:38Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"8e186a8490d851e519fbfa77e6ebc4121a474b86094d1b89abbd2af894ae8f86","abstract_canon_sha256":"87ab26fa40659c7587eeb798157fa703b236cd7d635b55b3bd8039a374665e90"},"schema_version":"1.0"},"canonical_sha256":"3c3268e1db036fe119ffb58460d18aa4ec27418853e33de01a21c7979ac25325","source":{"kind":"arxiv","id":"1207.5146","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.5146","created_at":"2026-05-18T03:50:24Z"},{"alias_kind":"arxiv_version","alias_value":"1207.5146v1","created_at":"2026-05-18T03:50:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.5146","created_at":"2026-05-18T03:50:24Z"},{"alias_kind":"pith_short_12","alias_value":"HQZGRYO3ANX6","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"HQZGRYO3ANX6CGP7","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"HQZGRYO3","created_at":"2026-05-18T12:27:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:HQZGRYO3ANX6CGP7WWCGBUMKUT","target":"record","payload":{"canonical_record":{"source":{"id":"1207.5146","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-21T14:36:38Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"8e186a8490d851e519fbfa77e6ebc4121a474b86094d1b89abbd2af894ae8f86","abstract_canon_sha256":"87ab26fa40659c7587eeb798157fa703b236cd7d635b55b3bd8039a374665e90"},"schema_version":"1.0"},"canonical_sha256":"3c3268e1db036fe119ffb58460d18aa4ec27418853e33de01a21c7979ac25325","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:50:24.420227Z","signature_b64":"WNgyYAucDCJKHyEUsTHK7gPPU6SwkJiubWxCbdWjS11U4MyyUQehcb0eOlARcEApCQqGMwEsOvZg1/kCkEPsBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3c3268e1db036fe119ffb58460d18aa4ec27418853e33de01a21c7979ac25325","last_reissued_at":"2026-05-18T03:50:24.419440Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:50:24.419440Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.5146","source_version":1,"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-18T03:50:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QCpDHTWBYTvb7FNR2aHiOsTxJ76DqFkw7FbhybKtpJj1HFzIEYe9or8CeiKjOJtTbx6JlumLzfy6K3Oj9c/BAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T01:49:06.379848Z"},"content_sha256":"53de6ecfaf26e3a87280b756f46d58117e63f99abf140f8a6bf90b594dce8188","schema_version":"1.0","event_id":"sha256:53de6ecfaf26e3a87280b756f46d58117e63f99abf140f8a6bf90b594dce8188"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:HQZGRYO3ANX6CGP7WWCGBUMKUT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Matroid Secretary for Regular and Decomposable Matroids","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Guy Kortsarz, Michael Dinitz","submitted_at":"2012-07-21T14:36:38Z","abstract_excerpt":"In the matroid secretary problem we are given a stream of elements and asked to choose a set of elements that maximizes the total value of the set, subject to being an independent set of a matroid given in advance. The difficulty comes from the assumption that decisions are irrevocable: if we choose to accept an element when it is presented by the stream then we can never get rid of it, and if we choose not to accept it then we cannot later add it. Babaioff, Immorlica, and Kleinberg [SODA 2007] introduced this problem, gave O(1)-competitive algorithms for certain classes of matroids, and conje"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.5146","kind":"arxiv","version":1},"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-18T03:50:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k/Gi51DGdaHlU4q8zH2gVuBTnWxMVpclwe3NjXZGKThFmgnwYWv1CpthNH4ulZWgFITLV8XYChuDLgr3qsoDBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T01:49:06.380586Z"},"content_sha256":"d96b8b21a821ef83d7376abf056c6535c857c48aac63c91d081b5ea8ebf87566","schema_version":"1.0","event_id":"sha256:d96b8b21a821ef83d7376abf056c6535c857c48aac63c91d081b5ea8ebf87566"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HQZGRYO3ANX6CGP7WWCGBUMKUT/bundle.json","state_url":"https://pith.science/pith/HQZGRYO3ANX6CGP7WWCGBUMKUT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HQZGRYO3ANX6CGP7WWCGBUMKUT/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-07T01:49:06Z","links":{"resolver":"https://pith.science/pith/HQZGRYO3ANX6CGP7WWCGBUMKUT","bundle":"https://pith.science/pith/HQZGRYO3ANX6CGP7WWCGBUMKUT/bundle.json","state":"https://pith.science/pith/HQZGRYO3ANX6CGP7WWCGBUMKUT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HQZGRYO3ANX6CGP7WWCGBUMKUT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:HQZGRYO3ANX6CGP7WWCGBUMKUT","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":"87ab26fa40659c7587eeb798157fa703b236cd7d635b55b3bd8039a374665e90","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-21T14:36:38Z","title_canon_sha256":"8e186a8490d851e519fbfa77e6ebc4121a474b86094d1b89abbd2af894ae8f86"},"schema_version":"1.0","source":{"id":"1207.5146","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.5146","created_at":"2026-05-18T03:50:24Z"},{"alias_kind":"arxiv_version","alias_value":"1207.5146v1","created_at":"2026-05-18T03:50:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.5146","created_at":"2026-05-18T03:50:24Z"},{"alias_kind":"pith_short_12","alias_value":"HQZGRYO3ANX6","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"HQZGRYO3ANX6CGP7","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"HQZGRYO3","created_at":"2026-05-18T12:27:09Z"}],"graph_snapshots":[{"event_id":"sha256:d96b8b21a821ef83d7376abf056c6535c857c48aac63c91d081b5ea8ebf87566","target":"graph","created_at":"2026-05-18T03:50:24Z","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 the matroid secretary problem we are given a stream of elements and asked to choose a set of elements that maximizes the total value of the set, subject to being an independent set of a matroid given in advance. The difficulty comes from the assumption that decisions are irrevocable: if we choose to accept an element when it is presented by the stream then we can never get rid of it, and if we choose not to accept it then we cannot later add it. Babaioff, Immorlica, and Kleinberg [SODA 2007] introduced this problem, gave O(1)-competitive algorithms for certain classes of matroids, and conje","authors_text":"Guy Kortsarz, Michael Dinitz","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-21T14:36:38Z","title":"Matroid Secretary for Regular and Decomposable Matroids"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.5146","kind":"arxiv","version":1},"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:53de6ecfaf26e3a87280b756f46d58117e63f99abf140f8a6bf90b594dce8188","target":"record","created_at":"2026-05-18T03:50:24Z","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":"87ab26fa40659c7587eeb798157fa703b236cd7d635b55b3bd8039a374665e90","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-21T14:36:38Z","title_canon_sha256":"8e186a8490d851e519fbfa77e6ebc4121a474b86094d1b89abbd2af894ae8f86"},"schema_version":"1.0","source":{"id":"1207.5146","kind":"arxiv","version":1}},"canonical_sha256":"3c3268e1db036fe119ffb58460d18aa4ec27418853e33de01a21c7979ac25325","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3c3268e1db036fe119ffb58460d18aa4ec27418853e33de01a21c7979ac25325","first_computed_at":"2026-05-18T03:50:24.419440Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:50:24.419440Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WNgyYAucDCJKHyEUsTHK7gPPU6SwkJiubWxCbdWjS11U4MyyUQehcb0eOlARcEApCQqGMwEsOvZg1/kCkEPsBA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:50:24.420227Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.5146","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:53de6ecfaf26e3a87280b756f46d58117e63f99abf140f8a6bf90b594dce8188","sha256:d96b8b21a821ef83d7376abf056c6535c857c48aac63c91d081b5ea8ebf87566"],"state_sha256":"442df7cf5882a51b9de1438a4e8a8a9f1dc49f7421c1ffdbbedd1bd794d9c5c8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t4IwGvmlRHwxrSA2KUrgilN7UYEcKMwLZ8Pzj+6V+3g9vQbxEMfoxPV2o06nSMlkNJ407mWFtdIB/iQ9URcRAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T01:49:06.384876Z","bundle_sha256":"3bd65e0666218993effccb172bc8f989640f3e1576ee4dded0dc4b78db0fd10b"}}