{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2005:TZO4ZP6XPI3UVSQ62IZ7SGJZ2M","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":"55b46b6477c1077c002e2211925d7a35ae220ff77ecf501777473ba7fc8ed2f6","cross_cats_sorted":[],"license":"","primary_cat":"math.DG","submitted_at":"2005-10-21T13:46:39Z","title_canon_sha256":"3b8ee1a669ed089381c3a6e775b904dbd93df4b90f20b3249d1a3006c93dd329"},"schema_version":"1.0","source":{"id":"math/0510463","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0510463","created_at":"2026-05-18T04:35:57Z"},{"alias_kind":"arxiv_version","alias_value":"math/0510463v1","created_at":"2026-05-18T04:35:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0510463","created_at":"2026-05-18T04:35:57Z"},{"alias_kind":"pith_short_12","alias_value":"TZO4ZP6XPI3U","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_16","alias_value":"TZO4ZP6XPI3UVSQ6","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_8","alias_value":"TZO4ZP6X","created_at":"2026-05-18T12:25:53Z"}],"graph_snapshots":[{"event_id":"sha256:1661e1aba36a6eda6977b5e9aa101e298657dfb8c87a31b8d166cedb73d9109b","target":"graph","created_at":"2026-05-18T04:35:57Z","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":"A graph (digraph) $G=(V,E)$ with a set $T\\subseteq V$ of terminals is called inner Eulerian if each nonterminal node $v$ has even degree (resp. the numbers of edges entering and leaving $v$ are equal). Cherkassky and Lov\\'asz showed that the maximum number of pairwise edge-disjoint $T$-paths in an inner Eulerian graph $G$ is equal to $\\frac12\\sum_{s\\in T} \\lambda(s)$, where $\\lambda(s)$ is the minimum number of edges whose removal disconnects $s$ and $T-\\{s\\}$. A similar relation for inner Eulerian digraphs was established by Lomonosov. Considering undirected and directed networks with ``inner","authors_text":"A.V. Karzanov, M.A. Babenko","cross_cats":[],"headline":"","license":"","primary_cat":"math.DG","submitted_at":"2005-10-21T13:46:39Z","title":"Free multiflows in bidirected and skew-symmetric graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0510463","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:bb20a9e511d9e5b2c3230690a147dbe6e63ea5c4bf769101412b6bfb014d6e9c","target":"record","created_at":"2026-05-18T04:35:57Z","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":"55b46b6477c1077c002e2211925d7a35ae220ff77ecf501777473ba7fc8ed2f6","cross_cats_sorted":[],"license":"","primary_cat":"math.DG","submitted_at":"2005-10-21T13:46:39Z","title_canon_sha256":"3b8ee1a669ed089381c3a6e775b904dbd93df4b90f20b3249d1a3006c93dd329"},"schema_version":"1.0","source":{"id":"math/0510463","kind":"arxiv","version":1}},"canonical_sha256":"9e5dccbfd77a374aca1ed233f91939d31ffaa3da266336a83da391482cf6f702","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9e5dccbfd77a374aca1ed233f91939d31ffaa3da266336a83da391482cf6f702","first_computed_at":"2026-05-18T04:35:57.844031Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:35:57.844031Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"m4NbxlOKUqR2oFcNcLGDhnglYkrL5ym0rjC0zUd5kTvBjyDijyTTxDngJH99fegPi4iOuYZH+isGdpMoC9hzDw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:35:57.844841Z","signed_message":"canonical_sha256_bytes"},"source_id":"math/0510463","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bb20a9e511d9e5b2c3230690a147dbe6e63ea5c4bf769101412b6bfb014d6e9c","sha256:1661e1aba36a6eda6977b5e9aa101e298657dfb8c87a31b8d166cedb73d9109b"],"state_sha256":"10793e1f4532225b0211f2c58e102f81f4638478ee2ad18decd1c028b5461046"}