{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:WKDLOCEUIM6VHVKC6CH634OABK","short_pith_number":"pith:WKDLOCEU","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"},"canonical_sha256":"b286b70894433d53d542f08fedf1c00a990d7264b03770938c1c7818d32e149b","source":{"kind":"arxiv","id":"2309.10214","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2309.10214","created_at":"2026-07-05T06:51:53Z"},{"alias_kind":"arxiv_version","alias_value":"2309.10214v1","created_at":"2026-07-05T06:51:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.10214","created_at":"2026-07-05T06:51:53Z"},{"alias_kind":"pith_short_12","alias_value":"WKDLOCEUIM6V","created_at":"2026-07-05T06:51:53Z"},{"alias_kind":"pith_short_16","alias_value":"WKDLOCEUIM6VHVKC","created_at":"2026-07-05T06:51:53Z"},{"alias_kind":"pith_short_8","alias_value":"WKDLOCEU","created_at":"2026-07-05T06:51:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:WKDLOCEUIM6VHVKC6CH634OABK","target":"record","payload":{"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"},"canonical_sha256":"b286b70894433d53d542f08fedf1c00a990d7264b03770938c1c7818d32e149b","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"},"source_kind":"arxiv","source_id":"2309.10214","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-05T06:51:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AXbddKLUMS1BFU4lM57BOtj9XTEWgNmFewp6zE3oTGJmotz3gvZG2udWFhQHXDrs/KQIu3Pj6ktphT5dllHWAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-31T16:02:39.998608Z"},"content_sha256":"c1132db15dffd8f2eeb7fef89040efa8fbe64f9705f3728289a1d19a03940c16","schema_version":"1.0","event_id":"sha256:c1132db15dffd8f2eeb7fef89040efa8fbe64f9705f3728289a1d19a03940c16"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:WKDLOCEUIM6VHVKC6CH634OABK","target":"graph","payload":{"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"},"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-05T06:51:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KEL35UOomoQDpuD3oYe5DIDRmUt/q5GDM1IfFwggr38YYgidW7pfrXI4cvknzZ6Nd1Je3AIsNeoUV20ZyHOtDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-31T16:02:39.999483Z"},"content_sha256":"5d699bd391fe1b91cb8a6caf7edc23c3beda9b939fc8f8ded4985a0a3c9109ee","schema_version":"1.0","event_id":"sha256:5d699bd391fe1b91cb8a6caf7edc23c3beda9b939fc8f8ded4985a0a3c9109ee"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WKDLOCEUIM6VHVKC6CH634OABK/bundle.json","state_url":"https://pith.science/pith/WKDLOCEUIM6VHVKC6CH634OABK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WKDLOCEUIM6VHVKC6CH634OABK/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-31T16:02:40Z","links":{"resolver":"https://pith.science/pith/WKDLOCEUIM6VHVKC6CH634OABK","bundle":"https://pith.science/pith/WKDLOCEUIM6VHVKC6CH634OABK/bundle.json","state":"https://pith.science/pith/WKDLOCEUIM6VHVKC6CH634OABK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WKDLOCEUIM6VHVKC6CH634OABK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:WKDLOCEUIM6VHVKC6CH634OABK","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":"c23dafdf48b2f6613194a624c11de74f6a586e799786775e9f820722c0205e17","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-09-18T23:54:12Z","title_canon_sha256":"cec81bbecf9c140bf6cae95a41d6250835c6949bb618719624e065cc471003f6"},"schema_version":"1.0","source":{"id":"2309.10214","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2309.10214","created_at":"2026-07-05T06:51:53Z"},{"alias_kind":"arxiv_version","alias_value":"2309.10214v1","created_at":"2026-07-05T06:51:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.10214","created_at":"2026-07-05T06:51:53Z"},{"alias_kind":"pith_short_12","alias_value":"WKDLOCEUIM6V","created_at":"2026-07-05T06:51:53Z"},{"alias_kind":"pith_short_16","alias_value":"WKDLOCEUIM6VHVKC","created_at":"2026-07-05T06:51:53Z"},{"alias_kind":"pith_short_8","alias_value":"WKDLOCEU","created_at":"2026-07-05T06:51:53Z"}],"graph_snapshots":[{"event_id":"sha256:5d699bd391fe1b91cb8a6caf7edc23c3beda9b939fc8f8ded4985a0a3c9109ee","target":"graph","created_at":"2026-07-05T06:51:53Z","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/2309.10214/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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}$ ","authors_text":"Anna R. Karlin, Anupam Gupta, Daniel Hathcock, Niv Buchbinder, Sherry Sarkar","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-09-18T23:54:12Z","title":"Maintaining Matroid Intersections Online"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.10214","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:c1132db15dffd8f2eeb7fef89040efa8fbe64f9705f3728289a1d19a03940c16","target":"record","created_at":"2026-07-05T06:51:53Z","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":"c23dafdf48b2f6613194a624c11de74f6a586e799786775e9f820722c0205e17","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-09-18T23:54:12Z","title_canon_sha256":"cec81bbecf9c140bf6cae95a41d6250835c6949bb618719624e065cc471003f6"},"schema_version":"1.0","source":{"id":"2309.10214","kind":"arxiv","version":1}},"canonical_sha256":"b286b70894433d53d542f08fedf1c00a990d7264b03770938c1c7818d32e149b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b286b70894433d53d542f08fedf1c00a990d7264b03770938c1c7818d32e149b","first_computed_at":"2026-07-05T06:51:53.083748Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:51:53.083748Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"s8kr9V1zQvSy96fM0dChz3iBv+oNKcJeoQrecjdsWjeLsINjCf/VVQlXGNUkZEHRzLgMxOLbwnaiWH9os1zXCA==","signature_status":"signed_v1","signed_at":"2026-07-05T06:51:53.084224Z","signed_message":"canonical_sha256_bytes"},"source_id":"2309.10214","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c1132db15dffd8f2eeb7fef89040efa8fbe64f9705f3728289a1d19a03940c16","sha256:5d699bd391fe1b91cb8a6caf7edc23c3beda9b939fc8f8ded4985a0a3c9109ee"],"state_sha256":"4e915ce95ccb810ee369e91ae17ec48b7205179266e13b177b68a20bf7e55e67"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DwOaX99q+kbYFc1pRj+FJy2J7BWEKYEigbs2pOl9+VsXI+N5SrW4brebXdU7+droR31Fb5aoZtmUeMlILK0jAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-31T16:02:40.007826Z","bundle_sha256":"459c7ceca06d2ed0733c6682602dba3f0bf5abd63a4b02876c671794e6f096a8"}}