{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:WKDLOCEUIM6VHVKC6CH634OABK","short_pith_number":"pith:WKDLOCEU","schema_version":"1.0","canonical_sha256":"b286b70894433d53d542f08fedf1c00a990d7264b03770938c1c7818d32e149b","source":{"kind":"arxiv","id":"2309.10214","version":1},"attestation_state":"computed","paper":{"title":"Maintaining Matroid Intersections Online","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Anna R. Karlin, Anupam Gupta, Daniel Hathcock, Niv Buchbinder, Sherry Sarkar","submitted_at":"2023-09-18T23:54:12Z","abstract_excerpt":"Maintaining a maximum bipartite matching online while minimizing recourse/augmentations is a well studied problem, motivated by content delivery, job scheduling, and hashing. A breakthrough result of Bernstein, Holm, and Rotenberg (\\emph{SODA 2018}) resolved this problem up to a logarithmic factors. However, we may need a richer class of combinatorial constraints (e.g., matroid constraints) to model other problems in scheduling and resource allocation.\n  We consider the problem of maintaining a maximum independent set of an arbitrary matroid $\\mathcal{M}$ and a partition matroid $\\mathcal{P}$ "},"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":"2309.10214","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-09-18T23:54:12Z","cross_cats_sorted":[],"title_canon_sha256":"cec81bbecf9c140bf6cae95a41d6250835c6949bb618719624e065cc471003f6","abstract_canon_sha256":"c23dafdf48b2f6613194a624c11de74f6a586e799786775e9f820722c0205e17"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:51:53.084224Z","signature_b64":"s8kr9V1zQvSy96fM0dChz3iBv+oNKcJeoQrecjdsWjeLsINjCf/VVQlXGNUkZEHRzLgMxOLbwnaiWH9os1zXCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b286b70894433d53d542f08fedf1c00a990d7264b03770938c1c7818d32e149b","last_reissued_at":"2026-07-05T06:51:53.083748Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:51:53.083748Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Maintaining Matroid Intersections Online","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Anna R. Karlin, Anupam Gupta, Daniel Hathcock, Niv Buchbinder, Sherry Sarkar","submitted_at":"2023-09-18T23:54:12Z","abstract_excerpt":"Maintaining a maximum bipartite matching online while minimizing recourse/augmentations is a well studied problem, motivated by content delivery, job scheduling, and hashing. A breakthrough result of Bernstein, Holm, and Rotenberg (\\emph{SODA 2018}) resolved this problem up to a logarithmic factors. However, we may need a richer class of combinatorial constraints (e.g., matroid constraints) to model other problems in scheduling and resource allocation.\n  We consider the problem of maintaining a maximum independent set of an arbitrary matroid $\\mathcal{M}$ and a partition matroid $\\mathcal{P}$ "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.10214","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/2309.10214/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2309.10214","created_at":"2026-07-05T06:51:53.083811+00:00"},{"alias_kind":"arxiv_version","alias_value":"2309.10214v1","created_at":"2026-07-05T06:51:53.083811+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.10214","created_at":"2026-07-05T06:51:53.083811+00:00"},{"alias_kind":"pith_short_12","alias_value":"WKDLOCEUIM6V","created_at":"2026-07-05T06:51:53.083811+00:00"},{"alias_kind":"pith_short_16","alias_value":"WKDLOCEUIM6VHVKC","created_at":"2026-07-05T06:51:53.083811+00:00"},{"alias_kind":"pith_short_8","alias_value":"WKDLOCEU","created_at":"2026-07-05T06:51:53.083811+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/WKDLOCEUIM6VHVKC6CH634OABK","json":"https://pith.science/pith/WKDLOCEUIM6VHVKC6CH634OABK.json","graph_json":"https://pith.science/api/pith-number/WKDLOCEUIM6VHVKC6CH634OABK/graph.json","events_json":"https://pith.science/api/pith-number/WKDLOCEUIM6VHVKC6CH634OABK/events.json","paper":"https://pith.science/paper/WKDLOCEU"},"agent_actions":{"view_html":"https://pith.science/pith/WKDLOCEUIM6VHVKC6CH634OABK","download_json":"https://pith.science/pith/WKDLOCEUIM6VHVKC6CH634OABK.json","view_paper":"https://pith.science/paper/WKDLOCEU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2309.10214&json=true","fetch_graph":"https://pith.science/api/pith-number/WKDLOCEUIM6VHVKC6CH634OABK/graph.json","fetch_events":"https://pith.science/api/pith-number/WKDLOCEUIM6VHVKC6CH634OABK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WKDLOCEUIM6VHVKC6CH634OABK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WKDLOCEUIM6VHVKC6CH634OABK/action/storage_attestation","attest_author":"https://pith.science/pith/WKDLOCEUIM6VHVKC6CH634OABK/action/author_attestation","sign_citation":"https://pith.science/pith/WKDLOCEUIM6VHVKC6CH634OABK/action/citation_signature","submit_replication":"https://pith.science/pith/WKDLOCEUIM6VHVKC6CH634OABK/action/replication_record"}},"created_at":"2026-07-05T06:51:53.083811+00:00","updated_at":"2026-07-05T06:51:53.083811+00:00"}