{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:MZKNBPQV7LFKJKCDKDKCR7YG2E","short_pith_number":"pith:MZKNBPQV","schema_version":"1.0","canonical_sha256":"6654d0be15facaa4a84350d428ff06d11982119b44b74e56ed61f9b40f518748","source":{"kind":"arxiv","id":"1205.1477","version":1},"attestation_state":"computed","paper":{"title":"Approximation Algorithms for Online Weighted Rank Function Maximization under Matroid Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Joseph (Seffi) Naor, Mohit Singh, Niv Buchbinder, R. Ravi","submitted_at":"2012-05-07T18:42:05Z","abstract_excerpt":"Consider the following online version of the submodular maximization problem under a matroid constraint: We are given a set of elements over which a matroid is defined. The goal is to incrementally choose a subset that remains independent in the matroid over time. At each time, a new weighted rank function of a different matroid (one per time) over the same elements is presented; the algorithm can add a few elements to the incrementally constructed set, and reaps a reward equal to the value of the new weighted rank function on the current set. The goal of the algorithm as it builds this indepe"},"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":"1205.1477","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-05-07T18:42:05Z","cross_cats_sorted":[],"title_canon_sha256":"e1a4e8eeb70cb0941fe09c2ff3431ab8ef077bde7111e3d1a04d9130e6bafb3b","abstract_canon_sha256":"412ddc3b1b7b480248523dc1054936ee78e0aa9174f52c7d49c5ebce5f1bc3f8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:56:11.100985Z","signature_b64":"e3RPNVVghCkNxb6JnhPiv47x3h/8XY4oLRwVnoU2jtefPlo6pjJKeQXExLlmH2Fl6Bhm0KiV31HqIGWkUqssAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6654d0be15facaa4a84350d428ff06d11982119b44b74e56ed61f9b40f518748","last_reissued_at":"2026-05-18T03:56:11.100208Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:56:11.100208Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximation Algorithms for Online Weighted Rank Function Maximization under Matroid Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Joseph (Seffi) Naor, Mohit Singh, Niv Buchbinder, R. Ravi","submitted_at":"2012-05-07T18:42:05Z","abstract_excerpt":"Consider the following online version of the submodular maximization problem under a matroid constraint: We are given a set of elements over which a matroid is defined. The goal is to incrementally choose a subset that remains independent in the matroid over time. At each time, a new weighted rank function of a different matroid (one per time) over the same elements is presented; the algorithm can add a few elements to the incrementally constructed set, and reaps a reward equal to the value of the new weighted rank function on the current set. The goal of the algorithm as it builds this indepe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.1477","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":"1205.1477","created_at":"2026-05-18T03:56:11.100343+00:00"},{"alias_kind":"arxiv_version","alias_value":"1205.1477v1","created_at":"2026-05-18T03:56:11.100343+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.1477","created_at":"2026-05-18T03:56:11.100343+00:00"},{"alias_kind":"pith_short_12","alias_value":"MZKNBPQV7LFK","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_16","alias_value":"MZKNBPQV7LFKJKCD","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_8","alias_value":"MZKNBPQV","created_at":"2026-05-18T12:27:14.488303+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/MZKNBPQV7LFKJKCDKDKCR7YG2E","json":"https://pith.science/pith/MZKNBPQV7LFKJKCDKDKCR7YG2E.json","graph_json":"https://pith.science/api/pith-number/MZKNBPQV7LFKJKCDKDKCR7YG2E/graph.json","events_json":"https://pith.science/api/pith-number/MZKNBPQV7LFKJKCDKDKCR7YG2E/events.json","paper":"https://pith.science/paper/MZKNBPQV"},"agent_actions":{"view_html":"https://pith.science/pith/MZKNBPQV7LFKJKCDKDKCR7YG2E","download_json":"https://pith.science/pith/MZKNBPQV7LFKJKCDKDKCR7YG2E.json","view_paper":"https://pith.science/paper/MZKNBPQV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1205.1477&json=true","fetch_graph":"https://pith.science/api/pith-number/MZKNBPQV7LFKJKCDKDKCR7YG2E/graph.json","fetch_events":"https://pith.science/api/pith-number/MZKNBPQV7LFKJKCDKDKCR7YG2E/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MZKNBPQV7LFKJKCDKDKCR7YG2E/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MZKNBPQV7LFKJKCDKDKCR7YG2E/action/storage_attestation","attest_author":"https://pith.science/pith/MZKNBPQV7LFKJKCDKDKCR7YG2E/action/author_attestation","sign_citation":"https://pith.science/pith/MZKNBPQV7LFKJKCDKDKCR7YG2E/action/citation_signature","submit_replication":"https://pith.science/pith/MZKNBPQV7LFKJKCDKDKCR7YG2E/action/replication_record"}},"created_at":"2026-05-18T03:56:11.100343+00:00","updated_at":"2026-05-18T03:56:11.100343+00:00"}