{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:R6Z2EYNEZ64JSAR4FODKWRQC75","short_pith_number":"pith:R6Z2EYNE","canonical_record":{"source":{"id":"2501.08846","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-01-15T14:58:41Z","cross_cats_sorted":[],"title_canon_sha256":"56cdb7bc877b9bf7e61e0ea660784cbe1d4f4dab1f5f494b653edc4db6133a8c","abstract_canon_sha256":"81820facb9544f627575d9359b2db6a2cd4658f8a1b46f5f0cb2bb49e8784048"},"schema_version":"1.0"},"canonical_sha256":"8fb3a261a4cfb899023c2b86ab4602ff7f467264581772b9854f7c9f35e20660","source":{"kind":"arxiv","id":"2501.08846","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.08846","created_at":"2026-07-05T10:01:26Z"},{"alias_kind":"arxiv_version","alias_value":"2501.08846v1","created_at":"2026-07-05T10:01:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.08846","created_at":"2026-07-05T10:01:26Z"},{"alias_kind":"pith_short_12","alias_value":"R6Z2EYNEZ64J","created_at":"2026-07-05T10:01:26Z"},{"alias_kind":"pith_short_16","alias_value":"R6Z2EYNEZ64JSAR4","created_at":"2026-07-05T10:01:26Z"},{"alias_kind":"pith_short_8","alias_value":"R6Z2EYNE","created_at":"2026-07-05T10:01:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:R6Z2EYNEZ64JSAR4FODKWRQC75","target":"record","payload":{"canonical_record":{"source":{"id":"2501.08846","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-01-15T14:58:41Z","cross_cats_sorted":[],"title_canon_sha256":"56cdb7bc877b9bf7e61e0ea660784cbe1d4f4dab1f5f494b653edc4db6133a8c","abstract_canon_sha256":"81820facb9544f627575d9359b2db6a2cd4658f8a1b46f5f0cb2bb49e8784048"},"schema_version":"1.0"},"canonical_sha256":"8fb3a261a4cfb899023c2b86ab4602ff7f467264581772b9854f7c9f35e20660","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:01:26.988231Z","signature_b64":"lTUbMg6LjjsqzGAXfEH9XLOUP+9og2ULtEpoS5M3OrVpxFFzaZPCaVKa5TbZtbv4MLnN/bY4qZfYYC94sE2CBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8fb3a261a4cfb899023c2b86ab4602ff7f467264581772b9854f7c9f35e20660","last_reissued_at":"2026-07-05T10:01:26.987776Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:01:26.987776Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2501.08846","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-07-05T10:01:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Nq1Wu4uoF6rUwO5EkmJDwJMER0bMkVuQ7z0EpJ+yPeUnQBm2eXyXvy5TzH+TVzO927y9/SfMEcFfwNEPJJH/Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T12:11:02.659254Z"},"content_sha256":"47ed0ba5e693f9638eac95278eadc97663d254a60b4af25bd947eba46e6fbd83","schema_version":"1.0","event_id":"sha256:47ed0ba5e693f9638eac95278eadc97663d254a60b4af25bd947eba46e6fbd83"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:R6Z2EYNEZ64JSAR4FODKWRQC75","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Beating Competitive Ratio 4 for Graphic Matroid Secretary","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Danny Mittal, Dariusz R. Kowalski, Jan Olkowski, Kiarash Banihashem, MohammadTaghi Hajiaghayi, Piotr Krysta","submitted_at":"2025-01-15T14:58:41Z","abstract_excerpt":"One of the classic problems in online decision-making is the *secretary problem* where to goal is to maximize the probability of choosing the largest number from a randomly ordered sequence. A natural extension allows selecting multiple values under a combinatorial constraint. Babaioff, Immorlica, Kempe, and Kleinberg (SODA'07, JACM'18) introduced the *matroid secretary conjecture*, suggesting an $O(1)$-competitive algorithm exists for matroids. Many works since have attempted to obtain algorithms for both general matroids and specific classes of matroids. The ultimate goal is to obtain an $e$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.08846","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2501.08846/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T10:01:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u4cjFKXzI3/J5YfCtgwgQuf0qM6HcAHhSy6QLKOB0dxphFG/uubjHZgvl8vLUzrenN5H4kDS3KT4qOd6INHKAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T12:11:02.659636Z"},"content_sha256":"257d6a14b64af526636e79ca53f1f724153aa2a08f5ebfceef96ac97956d1299","schema_version":"1.0","event_id":"sha256:257d6a14b64af526636e79ca53f1f724153aa2a08f5ebfceef96ac97956d1299"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R6Z2EYNEZ64JSAR4FODKWRQC75/bundle.json","state_url":"https://pith.science/pith/R6Z2EYNEZ64JSAR4FODKWRQC75/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R6Z2EYNEZ64JSAR4FODKWRQC75/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-07-07T12:11:02Z","links":{"resolver":"https://pith.science/pith/R6Z2EYNEZ64JSAR4FODKWRQC75","bundle":"https://pith.science/pith/R6Z2EYNEZ64JSAR4FODKWRQC75/bundle.json","state":"https://pith.science/pith/R6Z2EYNEZ64JSAR4FODKWRQC75/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R6Z2EYNEZ64JSAR4FODKWRQC75/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:R6Z2EYNEZ64JSAR4FODKWRQC75","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":"81820facb9544f627575d9359b2db6a2cd4658f8a1b46f5f0cb2bb49e8784048","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-01-15T14:58:41Z","title_canon_sha256":"56cdb7bc877b9bf7e61e0ea660784cbe1d4f4dab1f5f494b653edc4db6133a8c"},"schema_version":"1.0","source":{"id":"2501.08846","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.08846","created_at":"2026-07-05T10:01:26Z"},{"alias_kind":"arxiv_version","alias_value":"2501.08846v1","created_at":"2026-07-05T10:01:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.08846","created_at":"2026-07-05T10:01:26Z"},{"alias_kind":"pith_short_12","alias_value":"R6Z2EYNEZ64J","created_at":"2026-07-05T10:01:26Z"},{"alias_kind":"pith_short_16","alias_value":"R6Z2EYNEZ64JSAR4","created_at":"2026-07-05T10:01:26Z"},{"alias_kind":"pith_short_8","alias_value":"R6Z2EYNE","created_at":"2026-07-05T10:01:26Z"}],"graph_snapshots":[{"event_id":"sha256:257d6a14b64af526636e79ca53f1f724153aa2a08f5ebfceef96ac97956d1299","target":"graph","created_at":"2026-07-05T10:01:26Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2501.08846/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"One of the classic problems in online decision-making is the *secretary problem* where to goal is to maximize the probability of choosing the largest number from a randomly ordered sequence. A natural extension allows selecting multiple values under a combinatorial constraint. Babaioff, Immorlica, Kempe, and Kleinberg (SODA'07, JACM'18) introduced the *matroid secretary conjecture*, suggesting an $O(1)$-competitive algorithm exists for matroids. Many works since have attempted to obtain algorithms for both general matroids and specific classes of matroids. The ultimate goal is to obtain an $e$","authors_text":"Danny Mittal, Dariusz R. Kowalski, Jan Olkowski, Kiarash Banihashem, MohammadTaghi Hajiaghayi, Piotr Krysta","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-01-15T14:58:41Z","title":"Beating Competitive Ratio 4 for Graphic Matroid Secretary"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.08846","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:47ed0ba5e693f9638eac95278eadc97663d254a60b4af25bd947eba46e6fbd83","target":"record","created_at":"2026-07-05T10:01:26Z","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":"81820facb9544f627575d9359b2db6a2cd4658f8a1b46f5f0cb2bb49e8784048","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-01-15T14:58:41Z","title_canon_sha256":"56cdb7bc877b9bf7e61e0ea660784cbe1d4f4dab1f5f494b653edc4db6133a8c"},"schema_version":"1.0","source":{"id":"2501.08846","kind":"arxiv","version":1}},"canonical_sha256":"8fb3a261a4cfb899023c2b86ab4602ff7f467264581772b9854f7c9f35e20660","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8fb3a261a4cfb899023c2b86ab4602ff7f467264581772b9854f7c9f35e20660","first_computed_at":"2026-07-05T10:01:26.987776Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:01:26.987776Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lTUbMg6LjjsqzGAXfEH9XLOUP+9og2ULtEpoS5M3OrVpxFFzaZPCaVKa5TbZtbv4MLnN/bY4qZfYYC94sE2CBw==","signature_status":"signed_v1","signed_at":"2026-07-05T10:01:26.988231Z","signed_message":"canonical_sha256_bytes"},"source_id":"2501.08846","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:47ed0ba5e693f9638eac95278eadc97663d254a60b4af25bd947eba46e6fbd83","sha256:257d6a14b64af526636e79ca53f1f724153aa2a08f5ebfceef96ac97956d1299"],"state_sha256":"ef86f70fa184213675d4a41c8625c9694aae65f01ded5ea7236b478dea0d602b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dHppQpwf2TCxyhTBtxWdsryEIq4dqmLUp19ifqUJowuZTQYRUcflb/5e8octTCqi4tAfg7i/B876FU9DUEHhAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T12:11:02.661526Z","bundle_sha256":"bc745cdd2912e6589a420d1706e055f5306d98414108b52cc91a9b27c282f509"}}