{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:MZKNBPQV7LFKJKCDKDKCR7YG2E","short_pith_number":"pith:MZKNBPQV","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"},"canonical_sha256":"6654d0be15facaa4a84350d428ff06d11982119b44b74e56ed61f9b40f518748","source":{"kind":"arxiv","id":"1205.1477","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.1477","created_at":"2026-05-18T03:56:11Z"},{"alias_kind":"arxiv_version","alias_value":"1205.1477v1","created_at":"2026-05-18T03:56:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.1477","created_at":"2026-05-18T03:56:11Z"},{"alias_kind":"pith_short_12","alias_value":"MZKNBPQV7LFK","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"MZKNBPQV7LFKJKCD","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"MZKNBPQV","created_at":"2026-05-18T12:27:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:MZKNBPQV7LFKJKCDKDKCR7YG2E","target":"record","payload":{"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"},"canonical_sha256":"6654d0be15facaa4a84350d428ff06d11982119b44b74e56ed61f9b40f518748","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"},"source_kind":"arxiv","source_id":"1205.1477","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:56:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Vnc2xDBL7rlKqaHQ8s9+s7IytK0m7Ch9UFP73q2WNPWm3FL2dhP1SKLd/426HhLfbhyIk5TvlPVvZz0vGXFwBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T15:26:55.348861Z"},"content_sha256":"7fbaa2c7091d2e9bd0610eb1a0e18c3cbe3f8ee5cb474746d9f1d8da5d8525cc","schema_version":"1.0","event_id":"sha256:7fbaa2c7091d2e9bd0610eb1a0e18c3cbe3f8ee5cb474746d9f1d8da5d8525cc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:MZKNBPQV7LFKJKCDKDKCR7YG2E","target":"graph","payload":{"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"},"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:56:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lt1wZ0D4iFgSlDraC1Y8YOSWhjTPlWXvYn+vGVGQ4zLbzmreXyegra8Ikfyr98Ri8ucqZUL+shJXSzGkPcgMDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T15:26:55.349203Z"},"content_sha256":"4dfa1d4d3bd0b821408a4b5d25e4ab77d32f2259ca1e0ddb28a3f740a7a3ebee","schema_version":"1.0","event_id":"sha256:4dfa1d4d3bd0b821408a4b5d25e4ab77d32f2259ca1e0ddb28a3f740a7a3ebee"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MZKNBPQV7LFKJKCDKDKCR7YG2E/bundle.json","state_url":"https://pith.science/pith/MZKNBPQV7LFKJKCDKDKCR7YG2E/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MZKNBPQV7LFKJKCDKDKCR7YG2E/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-20T15:26:55Z","links":{"resolver":"https://pith.science/pith/MZKNBPQV7LFKJKCDKDKCR7YG2E","bundle":"https://pith.science/pith/MZKNBPQV7LFKJKCDKDKCR7YG2E/bundle.json","state":"https://pith.science/pith/MZKNBPQV7LFKJKCDKDKCR7YG2E/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MZKNBPQV7LFKJKCDKDKCR7YG2E/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:MZKNBPQV7LFKJKCDKDKCR7YG2E","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":"412ddc3b1b7b480248523dc1054936ee78e0aa9174f52c7d49c5ebce5f1bc3f8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-05-07T18:42:05Z","title_canon_sha256":"e1a4e8eeb70cb0941fe09c2ff3431ab8ef077bde7111e3d1a04d9130e6bafb3b"},"schema_version":"1.0","source":{"id":"1205.1477","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.1477","created_at":"2026-05-18T03:56:11Z"},{"alias_kind":"arxiv_version","alias_value":"1205.1477v1","created_at":"2026-05-18T03:56:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.1477","created_at":"2026-05-18T03:56:11Z"},{"alias_kind":"pith_short_12","alias_value":"MZKNBPQV7LFK","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"MZKNBPQV7LFKJKCD","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"MZKNBPQV","created_at":"2026-05-18T12:27:14Z"}],"graph_snapshots":[{"event_id":"sha256:4dfa1d4d3bd0b821408a4b5d25e4ab77d32f2259ca1e0ddb28a3f740a7a3ebee","target":"graph","created_at":"2026-05-18T03:56:11Z","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":"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","authors_text":"Joseph (Seffi) Naor, Mohit Singh, Niv Buchbinder, R. Ravi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-05-07T18:42:05Z","title":"Approximation Algorithms for Online Weighted Rank Function Maximization under Matroid Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.1477","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:7fbaa2c7091d2e9bd0610eb1a0e18c3cbe3f8ee5cb474746d9f1d8da5d8525cc","target":"record","created_at":"2026-05-18T03:56:11Z","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":"412ddc3b1b7b480248523dc1054936ee78e0aa9174f52c7d49c5ebce5f1bc3f8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-05-07T18:42:05Z","title_canon_sha256":"e1a4e8eeb70cb0941fe09c2ff3431ab8ef077bde7111e3d1a04d9130e6bafb3b"},"schema_version":"1.0","source":{"id":"1205.1477","kind":"arxiv","version":1}},"canonical_sha256":"6654d0be15facaa4a84350d428ff06d11982119b44b74e56ed61f9b40f518748","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6654d0be15facaa4a84350d428ff06d11982119b44b74e56ed61f9b40f518748","first_computed_at":"2026-05-18T03:56:11.100208Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:56:11.100208Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"e3RPNVVghCkNxb6JnhPiv47x3h/8XY4oLRwVnoU2jtefPlo6pjJKeQXExLlmH2Fl6Bhm0KiV31HqIGWkUqssAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:56:11.100985Z","signed_message":"canonical_sha256_bytes"},"source_id":"1205.1477","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7fbaa2c7091d2e9bd0610eb1a0e18c3cbe3f8ee5cb474746d9f1d8da5d8525cc","sha256:4dfa1d4d3bd0b821408a4b5d25e4ab77d32f2259ca1e0ddb28a3f740a7a3ebee"],"state_sha256":"fce7fcd1fd7ca5cc7be0891eb439ca747b62cda098521fd5a398289db5f87199"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Pm+zYdXMnqWmy3upwv8L6jJEZpnvU0yO34QWOSuOtyP5Xp66x84e7jQ7wJQu+696PR/kw/OwQDSAAQtCyBS+Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T15:26:55.351149Z","bundle_sha256":"91b18e2d324b426534a9c9e8b57a3f73f53835e6eea0395ecb25bf835c302f0e"}}