{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:V34E5YIWZRCWONUSV3A5CX2BR2","short_pith_number":"pith:V34E5YIW","canonical_record":{"source":{"id":"1704.02093","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-04-07T05:38:39Z","cross_cats_sorted":[],"title_canon_sha256":"e964fbf4af66693055689694ca1f6b94c341ca7f013ca7923bc0b9b65aefdb6b","abstract_canon_sha256":"61e4d170c1059b6909d6ac7d46ba276c49aa33ec300dec4c870b14e862b46dd4"},"schema_version":"1.0"},"canonical_sha256":"aef84ee116cc45673692aec1d15f418eb94cbeb200ddd4a04e8b7a8fbd0faecb","source":{"kind":"arxiv","id":"1704.02093","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.02093","created_at":"2026-05-18T00:27:36Z"},{"alias_kind":"arxiv_version","alias_value":"1704.02093v2","created_at":"2026-05-18T00:27:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.02093","created_at":"2026-05-18T00:27:36Z"},{"alias_kind":"pith_short_12","alias_value":"V34E5YIWZRCW","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"V34E5YIWZRCWONUS","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"V34E5YIW","created_at":"2026-05-18T12:31:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:V34E5YIWZRCWONUSV3A5CX2BR2","target":"record","payload":{"canonical_record":{"source":{"id":"1704.02093","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-04-07T05:38:39Z","cross_cats_sorted":[],"title_canon_sha256":"e964fbf4af66693055689694ca1f6b94c341ca7f013ca7923bc0b9b65aefdb6b","abstract_canon_sha256":"61e4d170c1059b6909d6ac7d46ba276c49aa33ec300dec4c870b14e862b46dd4"},"schema_version":"1.0"},"canonical_sha256":"aef84ee116cc45673692aec1d15f418eb94cbeb200ddd4a04e8b7a8fbd0faecb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:36.277049Z","signature_b64":"M2laKEkWAiLx85Spj3mF1O4o/eO+afotdOXFEEcNTfLde5dnvdmE3TE+8F1Lfuec3Ouib5q+ZVrdSiX2cnAuAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aef84ee116cc45673692aec1d15f418eb94cbeb200ddd4a04e8b7a8fbd0faecb","last_reissued_at":"2026-05-18T00:27:36.276422Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:36.276422Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.02093","source_version":2,"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:27:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2gKzBii3bjfAm604/5iG+3bbKKtKs7Eoy/X9l35Rpw9vPEc072Nrgd+FZjKGz6gHgGkqcnRs68NVnj7DmOMnDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T00:24:51.624717Z"},"content_sha256":"5dca4066d773ad9b6c27390c6d3ae4427cc1f8dbc21b80ac569a500579319c1d","schema_version":"1.0","event_id":"sha256:5dca4066d773ad9b6c27390c6d3ae4427cc1f8dbc21b80ac569a500579319c1d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:V34E5YIWZRCWONUSV3A5CX2BR2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Tight Bound for Shortest Augmenting Paths on Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Anna Zych-Pawlewicz, Bart{\\l}omiej Bosek, Dariusz Leniowski, Piotr Sankowski","submitted_at":"2017-04-07T05:38:39Z","abstract_excerpt":"The shortest augmenting path technique is one of the fundamental ideas used in maximum matching and maximum flow algorithms. Since being introduced by Edmonds and Karp in 1972, it has been widely applied in many different settings. Surprisingly, despite this extensive usage, it is still not well understood even in the simplest case: online bipartite matching problem on trees. In this problem a bipartite tree $T=(W \\uplus B, E)$ is being revealed online, i.e., in each round one vertex from $B$ with its incident edges arrives. It was conjectured by Chaudhuri et. al. [K. Chaudhuri, C. Daskalakis,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.02093","kind":"arxiv","version":2},"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:27:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NsGpNCBS0ASGRrurplIjeG2vlSBdiK9XdPBq7CY6c09rAmOUJILr4EZo/NqH5FCU5nZ9sdFF23V0ENUPYo8VDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T00:24:51.625444Z"},"content_sha256":"c5d70bf4e90ca62dd9189115eb46b00b778b45afdc45ca2393f09630bdd7175a","schema_version":"1.0","event_id":"sha256:c5d70bf4e90ca62dd9189115eb46b00b778b45afdc45ca2393f09630bdd7175a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/V34E5YIWZRCWONUSV3A5CX2BR2/bundle.json","state_url":"https://pith.science/pith/V34E5YIWZRCWONUSV3A5CX2BR2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/V34E5YIWZRCWONUSV3A5CX2BR2/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-05-25T00:24:51Z","links":{"resolver":"https://pith.science/pith/V34E5YIWZRCWONUSV3A5CX2BR2","bundle":"https://pith.science/pith/V34E5YIWZRCWONUSV3A5CX2BR2/bundle.json","state":"https://pith.science/pith/V34E5YIWZRCWONUSV3A5CX2BR2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/V34E5YIWZRCWONUSV3A5CX2BR2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:V34E5YIWZRCWONUSV3A5CX2BR2","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":"61e4d170c1059b6909d6ac7d46ba276c49aa33ec300dec4c870b14e862b46dd4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-04-07T05:38:39Z","title_canon_sha256":"e964fbf4af66693055689694ca1f6b94c341ca7f013ca7923bc0b9b65aefdb6b"},"schema_version":"1.0","source":{"id":"1704.02093","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.02093","created_at":"2026-05-18T00:27:36Z"},{"alias_kind":"arxiv_version","alias_value":"1704.02093v2","created_at":"2026-05-18T00:27:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.02093","created_at":"2026-05-18T00:27:36Z"},{"alias_kind":"pith_short_12","alias_value":"V34E5YIWZRCW","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"V34E5YIWZRCWONUS","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"V34E5YIW","created_at":"2026-05-18T12:31:49Z"}],"graph_snapshots":[{"event_id":"sha256:c5d70bf4e90ca62dd9189115eb46b00b778b45afdc45ca2393f09630bdd7175a","target":"graph","created_at":"2026-05-18T00:27:36Z","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":"The shortest augmenting path technique is one of the fundamental ideas used in maximum matching and maximum flow algorithms. Since being introduced by Edmonds and Karp in 1972, it has been widely applied in many different settings. Surprisingly, despite this extensive usage, it is still not well understood even in the simplest case: online bipartite matching problem on trees. In this problem a bipartite tree $T=(W \\uplus B, E)$ is being revealed online, i.e., in each round one vertex from $B$ with its incident edges arrives. It was conjectured by Chaudhuri et. al. [K. Chaudhuri, C. Daskalakis,","authors_text":"Anna Zych-Pawlewicz, Bart{\\l}omiej Bosek, Dariusz Leniowski, Piotr Sankowski","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-04-07T05:38:39Z","title":"A Tight Bound for Shortest Augmenting Paths on Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.02093","kind":"arxiv","version":2},"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:5dca4066d773ad9b6c27390c6d3ae4427cc1f8dbc21b80ac569a500579319c1d","target":"record","created_at":"2026-05-18T00:27:36Z","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":"61e4d170c1059b6909d6ac7d46ba276c49aa33ec300dec4c870b14e862b46dd4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-04-07T05:38:39Z","title_canon_sha256":"e964fbf4af66693055689694ca1f6b94c341ca7f013ca7923bc0b9b65aefdb6b"},"schema_version":"1.0","source":{"id":"1704.02093","kind":"arxiv","version":2}},"canonical_sha256":"aef84ee116cc45673692aec1d15f418eb94cbeb200ddd4a04e8b7a8fbd0faecb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aef84ee116cc45673692aec1d15f418eb94cbeb200ddd4a04e8b7a8fbd0faecb","first_computed_at":"2026-05-18T00:27:36.276422Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:27:36.276422Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"M2laKEkWAiLx85Spj3mF1O4o/eO+afotdOXFEEcNTfLde5dnvdmE3TE+8F1Lfuec3Ouib5q+ZVrdSiX2cnAuAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:27:36.277049Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.02093","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5dca4066d773ad9b6c27390c6d3ae4427cc1f8dbc21b80ac569a500579319c1d","sha256:c5d70bf4e90ca62dd9189115eb46b00b778b45afdc45ca2393f09630bdd7175a"],"state_sha256":"e270b3113111a616a976a6fea7c34c513982fe3f91c5b93d259242b1cc1a86fc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"27fGXeHC4kgL+MS/Uo3Dhp03z+5hByniRw9wIHYL9h6UlXfqw/BB0my0Hv8DnBbBi6D90quJ/O7RfeD0aIRVAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T00:24:51.628547Z","bundle_sha256":"b2914905130f43d2ccf8cdd51edcdfa1f496c2cdde663f103391157212904258"}}