{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:V7ZO4CQZCXZ4KSOTCJBGPNLZLD","short_pith_number":"pith:V7ZO4CQZ","canonical_record":{"source":{"id":"1309.3701","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-09-14T21:17:28Z","cross_cats_sorted":["cs.DS","math.CO"],"title_canon_sha256":"4f36395186fa1fe881502bb841d94b2a05141ebf9143d6603c9ab44f5fca0525","abstract_canon_sha256":"0c8f9c84d9750c264fa44f393c48cda032fbd74686c7be20fa2b7ce642cc554f"},"schema_version":"1.0"},"canonical_sha256":"aff2ee0a1915f3c549d3124267b57958e33f74cad3f1ec2727b85af0e577e887","source":{"kind":"arxiv","id":"1309.3701","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.3701","created_at":"2026-05-17T23:57:35Z"},{"alias_kind":"arxiv_version","alias_value":"1309.3701v3","created_at":"2026-05-17T23:57:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.3701","created_at":"2026-05-17T23:57:35Z"},{"alias_kind":"pith_short_12","alias_value":"V7ZO4CQZCXZ4","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"V7ZO4CQZCXZ4KSOT","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"V7ZO4CQZ","created_at":"2026-05-18T12:28:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:V7ZO4CQZCXZ4KSOTCJBGPNLZLD","target":"record","payload":{"canonical_record":{"source":{"id":"1309.3701","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-09-14T21:17:28Z","cross_cats_sorted":["cs.DS","math.CO"],"title_canon_sha256":"4f36395186fa1fe881502bb841d94b2a05141ebf9143d6603c9ab44f5fca0525","abstract_canon_sha256":"0c8f9c84d9750c264fa44f393c48cda032fbd74686c7be20fa2b7ce642cc554f"},"schema_version":"1.0"},"canonical_sha256":"aff2ee0a1915f3c549d3124267b57958e33f74cad3f1ec2727b85af0e577e887","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:35.409491Z","signature_b64":"d3ulF2sFI9aq6KxyoJcWeot1YAG6bMsZOYEDureJAdoab7Yt+9AqPm3JUpekq+xVgXnS30wG900lT0xyGQJMCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aff2ee0a1915f3c549d3124267b57958e33f74cad3f1ec2727b85af0e577e887","last_reissued_at":"2026-05-17T23:57:35.408840Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:35.408840Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1309.3701","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-17T23:57:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4AeeeL6o6uSzLy+NWov+iaPVwi3igAUHwH3+Jkz9Lr+OcyK6ttBxgQoMUndcqeb9uizbICey9m7SYSVxU0imCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T19:51:44.637799Z"},"content_sha256":"6532873e7223d351e1dbc9feee1c2528597ef0bfc0e7b2333591a01d319ab1ec","schema_version":"1.0","event_id":"sha256:6532873e7223d351e1dbc9feee1c2528597ef0bfc0e7b2333591a01d319ab1ec"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:V7ZO4CQZCXZ4KSOTCJBGPNLZLD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"New and simple algorithms for stable flow problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.CO"],"primary_cat":"cs.DM","authors_text":"\\'Agnes Cseh, Jannik Matuschke","submitted_at":"2013-09-14T21:17:28Z","abstract_excerpt":"Stable flows generalize the well-known concept of stable matchings to markets in which transactions may involve several agents, forwarding flow from one to another. An instance of the problem consists of a capacitated directed network, in which vertices express their preferences over their incident edges. A network flow is stable if there is no group of vertices that all could benefit from rerouting the flow along a walk.\n  Fleiner established that a stable flow always exists by reducing it to the stable allocation problem. We present an augmenting-path algorithm for computing a stable flow, t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.3701","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-17T23:57:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tyse7y8zWgjlq+5nbfPmKJU4cj/icY6H3xBCX4btuGKeZfkQCVrpOkA0jNIVhtdc4KKVg7Mse3e+L+qQL2EMCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T19:51:44.638150Z"},"content_sha256":"2809008f26033329604c759da7f0b9d04bbba1d3241336cb72f4133df34a0e04","schema_version":"1.0","event_id":"sha256:2809008f26033329604c759da7f0b9d04bbba1d3241336cb72f4133df34a0e04"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/V7ZO4CQZCXZ4KSOTCJBGPNLZLD/bundle.json","state_url":"https://pith.science/pith/V7ZO4CQZCXZ4KSOTCJBGPNLZLD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/V7ZO4CQZCXZ4KSOTCJBGPNLZLD/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-03T19:51:44Z","links":{"resolver":"https://pith.science/pith/V7ZO4CQZCXZ4KSOTCJBGPNLZLD","bundle":"https://pith.science/pith/V7ZO4CQZCXZ4KSOTCJBGPNLZLD/bundle.json","state":"https://pith.science/pith/V7ZO4CQZCXZ4KSOTCJBGPNLZLD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/V7ZO4CQZCXZ4KSOTCJBGPNLZLD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:V7ZO4CQZCXZ4KSOTCJBGPNLZLD","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":"0c8f9c84d9750c264fa44f393c48cda032fbd74686c7be20fa2b7ce642cc554f","cross_cats_sorted":["cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-09-14T21:17:28Z","title_canon_sha256":"4f36395186fa1fe881502bb841d94b2a05141ebf9143d6603c9ab44f5fca0525"},"schema_version":"1.0","source":{"id":"1309.3701","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.3701","created_at":"2026-05-17T23:57:35Z"},{"alias_kind":"arxiv_version","alias_value":"1309.3701v3","created_at":"2026-05-17T23:57:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.3701","created_at":"2026-05-17T23:57:35Z"},{"alias_kind":"pith_short_12","alias_value":"V7ZO4CQZCXZ4","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"V7ZO4CQZCXZ4KSOT","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"V7ZO4CQZ","created_at":"2026-05-18T12:28:04Z"}],"graph_snapshots":[{"event_id":"sha256:2809008f26033329604c759da7f0b9d04bbba1d3241336cb72f4133df34a0e04","target":"graph","created_at":"2026-05-17T23:57:35Z","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":"Stable flows generalize the well-known concept of stable matchings to markets in which transactions may involve several agents, forwarding flow from one to another. An instance of the problem consists of a capacitated directed network, in which vertices express their preferences over their incident edges. A network flow is stable if there is no group of vertices that all could benefit from rerouting the flow along a walk.\n  Fleiner established that a stable flow always exists by reducing it to the stable allocation problem. We present an augmenting-path algorithm for computing a stable flow, t","authors_text":"\\'Agnes Cseh, Jannik Matuschke","cross_cats":["cs.DS","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-09-14T21:17:28Z","title":"New and simple algorithms for stable flow problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.3701","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:6532873e7223d351e1dbc9feee1c2528597ef0bfc0e7b2333591a01d319ab1ec","target":"record","created_at":"2026-05-17T23:57:35Z","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":"0c8f9c84d9750c264fa44f393c48cda032fbd74686c7be20fa2b7ce642cc554f","cross_cats_sorted":["cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-09-14T21:17:28Z","title_canon_sha256":"4f36395186fa1fe881502bb841d94b2a05141ebf9143d6603c9ab44f5fca0525"},"schema_version":"1.0","source":{"id":"1309.3701","kind":"arxiv","version":3}},"canonical_sha256":"aff2ee0a1915f3c549d3124267b57958e33f74cad3f1ec2727b85af0e577e887","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aff2ee0a1915f3c549d3124267b57958e33f74cad3f1ec2727b85af0e577e887","first_computed_at":"2026-05-17T23:57:35.408840Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:57:35.408840Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"d3ulF2sFI9aq6KxyoJcWeot1YAG6bMsZOYEDureJAdoab7Yt+9AqPm3JUpekq+xVgXnS30wG900lT0xyGQJMCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:57:35.409491Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.3701","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6532873e7223d351e1dbc9feee1c2528597ef0bfc0e7b2333591a01d319ab1ec","sha256:2809008f26033329604c759da7f0b9d04bbba1d3241336cb72f4133df34a0e04"],"state_sha256":"03fecf550e49b5ea23c92a08206f834ff1b7e813fed54ffdedb41787f3810fc5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EvFX23KzRDCukfDajvbv6HxuGG29auo0fLsGT4B/oZR4sKl83gT3vpNAYeufbMTyLmb5+TfNLDrhGfKg1sy+Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T19:51:44.640082Z","bundle_sha256":"afadc094ab481d3a6d72c1db17dbaffcb9fbec060559b3a4e0f6236129988634"}}