{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:7T4FQKGWG3I3LN5O3XGTJ6NT56","short_pith_number":"pith:7T4FQKGW","canonical_record":{"source":{"id":"1612.05419","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-12-16T10:38:56Z","cross_cats_sorted":[],"title_canon_sha256":"357f039b07f8fa8bdeee757fe8341aeac1f0c640fbe1b6100ad5b4a49da84d38","abstract_canon_sha256":"a7ee05a79eb62910215de9e346d2d7b0e48693c6e4504eb4352f19baed6d33cc"},"schema_version":"1.0"},"canonical_sha256":"fcf85828d636d1b5b7aeddcd34f9b3efa5f71bd97733edc525632f60612c8a61","source":{"kind":"arxiv","id":"1612.05419","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.05419","created_at":"2026-05-18T00:25:29Z"},{"alias_kind":"arxiv_version","alias_value":"1612.05419v3","created_at":"2026-05-18T00:25:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.05419","created_at":"2026-05-18T00:25:29Z"},{"alias_kind":"pith_short_12","alias_value":"7T4FQKGWG3I3","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"7T4FQKGWG3I3LN5O","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"7T4FQKGW","created_at":"2026-05-18T12:30:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:7T4FQKGWG3I3LN5O3XGTJ6NT56","target":"record","payload":{"canonical_record":{"source":{"id":"1612.05419","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-12-16T10:38:56Z","cross_cats_sorted":[],"title_canon_sha256":"357f039b07f8fa8bdeee757fe8341aeac1f0c640fbe1b6100ad5b4a49da84d38","abstract_canon_sha256":"a7ee05a79eb62910215de9e346d2d7b0e48693c6e4504eb4352f19baed6d33cc"},"schema_version":"1.0"},"canonical_sha256":"fcf85828d636d1b5b7aeddcd34f9b3efa5f71bd97733edc525632f60612c8a61","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:29.249122Z","signature_b64":"7YaP1lW4w8+0s6VwZ+f2JQQp1adtfnjD2qe5bmNFU/7eSXUg+A0A+rTXq98AK56Nb0S2QPLFORRhi3IPYa5LDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fcf85828d636d1b5b7aeddcd34f9b3efa5f71bd97733edc525632f60612c8a61","last_reissued_at":"2026-05-18T00:25:29.248310Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:29.248310Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1612.05419","source_version":3,"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-18T00:25:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9fMTWBiKTjI6pykibS9gBuGr2w2imeYyBDG6ibM6/cNSbmGKNISc+BppGD0/fZ3tQYFc2xg3JOPrDdLD/HTPAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T01:25:26.206428Z"},"content_sha256":"50d3fe7a7b0e8681a34cf241e883d4fce7a4fac6482089e769cf270b7e227606","schema_version":"1.0","event_id":"sha256:50d3fe7a7b0e8681a34cf241e883d4fce7a4fac6482089e769cf270b7e227606"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:7T4FQKGWG3I3LN5O3XGTJ6NT56","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Maximum Matching on Trees in the Online Preemptive and the Incremental Dynamic Graph Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Sumedh Tirodkar, Sundar Vishwanathan","submitted_at":"2016-12-16T10:38:56Z","abstract_excerpt":"We study the Maximum Cardinality Matching (MCM) and the Maximum Weight Matching (MWM) problems, on trees and on some special classes of graphs, in the Online Preemptive and the Incremental Dynamic Graph models. In the {\\em Online Preemptive} model, the edges of a graph are revealed one by one and the algorithm is required to always maintain a valid matching. On seeing an edge, the algorithm has to either accept or reject the edge. If accepted, then the adjacent edges are discarded, and all rejections are permanent. In this model, the complexity of the problems is settled for deterministic algo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.05419","kind":"arxiv","version":3},"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-18T00:25:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dMABJ1IXIzUO7gzQ4IK09foceqwFsfYTso1jE2HsvF37rajdGriJ2KT037UnUSRGdN1ay/55zYPVzQaTgOGYCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T01:25:26.206779Z"},"content_sha256":"944a4b3a98076652bcaa6011fb4265fb1e70e178d0d3660d8b9f5d1292ba98d0","schema_version":"1.0","event_id":"sha256:944a4b3a98076652bcaa6011fb4265fb1e70e178d0d3660d8b9f5d1292ba98d0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7T4FQKGWG3I3LN5O3XGTJ6NT56/bundle.json","state_url":"https://pith.science/pith/7T4FQKGWG3I3LN5O3XGTJ6NT56/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7T4FQKGWG3I3LN5O3XGTJ6NT56/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-22T01:25:26Z","links":{"resolver":"https://pith.science/pith/7T4FQKGWG3I3LN5O3XGTJ6NT56","bundle":"https://pith.science/pith/7T4FQKGWG3I3LN5O3XGTJ6NT56/bundle.json","state":"https://pith.science/pith/7T4FQKGWG3I3LN5O3XGTJ6NT56/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7T4FQKGWG3I3LN5O3XGTJ6NT56/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:7T4FQKGWG3I3LN5O3XGTJ6NT56","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":"a7ee05a79eb62910215de9e346d2d7b0e48693c6e4504eb4352f19baed6d33cc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-12-16T10:38:56Z","title_canon_sha256":"357f039b07f8fa8bdeee757fe8341aeac1f0c640fbe1b6100ad5b4a49da84d38"},"schema_version":"1.0","source":{"id":"1612.05419","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.05419","created_at":"2026-05-18T00:25:29Z"},{"alias_kind":"arxiv_version","alias_value":"1612.05419v3","created_at":"2026-05-18T00:25:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.05419","created_at":"2026-05-18T00:25:29Z"},{"alias_kind":"pith_short_12","alias_value":"7T4FQKGWG3I3","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"7T4FQKGWG3I3LN5O","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"7T4FQKGW","created_at":"2026-05-18T12:30:04Z"}],"graph_snapshots":[{"event_id":"sha256:944a4b3a98076652bcaa6011fb4265fb1e70e178d0d3660d8b9f5d1292ba98d0","target":"graph","created_at":"2026-05-18T00:25:29Z","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":"We study the Maximum Cardinality Matching (MCM) and the Maximum Weight Matching (MWM) problems, on trees and on some special classes of graphs, in the Online Preemptive and the Incremental Dynamic Graph models. In the {\\em Online Preemptive} model, the edges of a graph are revealed one by one and the algorithm is required to always maintain a valid matching. On seeing an edge, the algorithm has to either accept or reject the edge. If accepted, then the adjacent edges are discarded, and all rejections are permanent. In this model, the complexity of the problems is settled for deterministic algo","authors_text":"Sumedh Tirodkar, Sundar Vishwanathan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-12-16T10:38:56Z","title":"Maximum Matching on Trees in the Online Preemptive and the Incremental Dynamic Graph Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.05419","kind":"arxiv","version":3},"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:50d3fe7a7b0e8681a34cf241e883d4fce7a4fac6482089e769cf270b7e227606","target":"record","created_at":"2026-05-18T00:25:29Z","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":"a7ee05a79eb62910215de9e346d2d7b0e48693c6e4504eb4352f19baed6d33cc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-12-16T10:38:56Z","title_canon_sha256":"357f039b07f8fa8bdeee757fe8341aeac1f0c640fbe1b6100ad5b4a49da84d38"},"schema_version":"1.0","source":{"id":"1612.05419","kind":"arxiv","version":3}},"canonical_sha256":"fcf85828d636d1b5b7aeddcd34f9b3efa5f71bd97733edc525632f60612c8a61","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fcf85828d636d1b5b7aeddcd34f9b3efa5f71bd97733edc525632f60612c8a61","first_computed_at":"2026-05-18T00:25:29.248310Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:25:29.248310Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7YaP1lW4w8+0s6VwZ+f2JQQp1adtfnjD2qe5bmNFU/7eSXUg+A0A+rTXq98AK56Nb0S2QPLFORRhi3IPYa5LDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:25:29.249122Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.05419","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:50d3fe7a7b0e8681a34cf241e883d4fce7a4fac6482089e769cf270b7e227606","sha256:944a4b3a98076652bcaa6011fb4265fb1e70e178d0d3660d8b9f5d1292ba98d0"],"state_sha256":"0c89d168dded8d2273708277144dddc2232502a2bd6e4c81a65e24dc6946f278"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q1vKvOfG/bKvfSasZSEUCAstJdAI6FHhrBSmhmmOFFNcgbVGawK1jSV8zMsAUr0iVq2/sG7A8eIVRzpqT8k8Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T01:25:26.208661Z","bundle_sha256":"9d3b55b80287daa8b61c5c66d4c73c960bcb0c0cda837fd67b0f902f2c268d2e"}}