{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:AQTUJTOOTW5HPLLH2HPEFSKQSG","short_pith_number":"pith:AQTUJTOO","schema_version":"1.0","canonical_sha256":"042744cdce9dba77ad67d1de42c9509186f5d123e441568f455ed1afff6b77de","source":{"kind":"arxiv","id":"1704.02608","version":1},"attestation_state":"computed","paper":{"title":"A Framework for the Secretary Problem on the Intersection of Matroids","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Moran Feldman, Ola Svensson, Rico Zenklusen","submitted_at":"2017-04-09T14:19:17Z","abstract_excerpt":"The secretary problem became one of the most prominent online selection problems due to its numerous applications in online mechanism design. The task is to select a maximum weight subset of elements subject to given constraints, where elements arrive one-by-one in random order, revealing a weight upon arrival. The decision whether to select an element has to be taken immediately after its arrival. The different applications that map to the secretary problem ask for different constraint families to be handled. The most prominent ones are matroid constraints, which both capture many relevant se"},"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":"1704.02608","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-09T14:19:17Z","cross_cats_sorted":[],"title_canon_sha256":"d588c1f4e69aad69757939c95f995967d32b0550d21e87b631ad3ed11c24549c","abstract_canon_sha256":"9cf6a007c2c339bb181b60766b1044061bbb49f195918eb003addb4226a8d29c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:44.984218Z","signature_b64":"zXhcY7PNWEYmjgJN3S3spk+SrYTxTl3XU0R5UQZZHyy/KHQbd08eN4uYhx5hJWzxVF2phAqh6hPsFrXhxRFdCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"042744cdce9dba77ad67d1de42c9509186f5d123e441568f455ed1afff6b77de","last_reissued_at":"2026-05-18T00:46:44.983527Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:44.983527Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Framework for the Secretary Problem on the Intersection of Matroids","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Moran Feldman, Ola Svensson, Rico Zenklusen","submitted_at":"2017-04-09T14:19:17Z","abstract_excerpt":"The secretary problem became one of the most prominent online selection problems due to its numerous applications in online mechanism design. The task is to select a maximum weight subset of elements subject to given constraints, where elements arrive one-by-one in random order, revealing a weight upon arrival. The decision whether to select an element has to be taken immediately after its arrival. The different applications that map to the secretary problem ask for different constraint families to be handled. The most prominent ones are matroid constraints, which both capture many relevant se"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.02608","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1704.02608","created_at":"2026-05-18T00:46:44.983643+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.02608v1","created_at":"2026-05-18T00:46:44.983643+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.02608","created_at":"2026-05-18T00:46:44.983643+00:00"},{"alias_kind":"pith_short_12","alias_value":"AQTUJTOOTW5H","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"AQTUJTOOTW5HPLLH","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"AQTUJTOO","created_at":"2026-05-18T12:31:05.417338+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/AQTUJTOOTW5HPLLH2HPEFSKQSG","json":"https://pith.science/pith/AQTUJTOOTW5HPLLH2HPEFSKQSG.json","graph_json":"https://pith.science/api/pith-number/AQTUJTOOTW5HPLLH2HPEFSKQSG/graph.json","events_json":"https://pith.science/api/pith-number/AQTUJTOOTW5HPLLH2HPEFSKQSG/events.json","paper":"https://pith.science/paper/AQTUJTOO"},"agent_actions":{"view_html":"https://pith.science/pith/AQTUJTOOTW5HPLLH2HPEFSKQSG","download_json":"https://pith.science/pith/AQTUJTOOTW5HPLLH2HPEFSKQSG.json","view_paper":"https://pith.science/paper/AQTUJTOO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.02608&json=true","fetch_graph":"https://pith.science/api/pith-number/AQTUJTOOTW5HPLLH2HPEFSKQSG/graph.json","fetch_events":"https://pith.science/api/pith-number/AQTUJTOOTW5HPLLH2HPEFSKQSG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AQTUJTOOTW5HPLLH2HPEFSKQSG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AQTUJTOOTW5HPLLH2HPEFSKQSG/action/storage_attestation","attest_author":"https://pith.science/pith/AQTUJTOOTW5HPLLH2HPEFSKQSG/action/author_attestation","sign_citation":"https://pith.science/pith/AQTUJTOOTW5HPLLH2HPEFSKQSG/action/citation_signature","submit_replication":"https://pith.science/pith/AQTUJTOOTW5HPLLH2HPEFSKQSG/action/replication_record"}},"created_at":"2026-05-18T00:46:44.983643+00:00","updated_at":"2026-05-18T00:46:44.983643+00:00"}