{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2005:TZO4ZP6XPI3UVSQ62IZ7SGJZ2M","short_pith_number":"pith:TZO4ZP6X","schema_version":"1.0","canonical_sha256":"9e5dccbfd77a374aca1ed233f91939d31ffaa3da266336a83da391482cf6f702","source":{"kind":"arxiv","id":"math/0510463","version":1},"attestation_state":"computed","paper":{"title":"Free multiflows in bidirected and skew-symmetric graphs","license":"","headline":"","cross_cats":[],"primary_cat":"math.DG","authors_text":"A.V. Karzanov, M.A. Babenko","submitted_at":"2005-10-21T13:46:39Z","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"math/0510463","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.DG","submitted_at":"2005-10-21T13:46:39Z","cross_cats_sorted":[],"title_canon_sha256":"3b8ee1a669ed089381c3a6e775b904dbd93df4b90f20b3249d1a3006c93dd329","abstract_canon_sha256":"55b46b6477c1077c002e2211925d7a35ae220ff77ecf501777473ba7fc8ed2f6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:35:57.844841Z","signature_b64":"m4NbxlOKUqR2oFcNcLGDhnglYkrL5ym0rjC0zUd5kTvBjyDijyTTxDngJH99fegPi4iOuYZH+isGdpMoC9hzDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9e5dccbfd77a374aca1ed233f91939d31ffaa3da266336a83da391482cf6f702","last_reissued_at":"2026-05-18T04:35:57.844031Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:35:57.844031Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Free multiflows in bidirected and skew-symmetric graphs","license":"","headline":"","cross_cats":[],"primary_cat":"math.DG","authors_text":"A.V. Karzanov, M.A. Babenko","submitted_at":"2005-10-21T13:46:39Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0510463","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":""},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"math/0510463","created_at":"2026-05-18T04:35:57.844156+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0510463v1","created_at":"2026-05-18T04:35:57.844156+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0510463","created_at":"2026-05-18T04:35:57.844156+00:00"},{"alias_kind":"pith_short_12","alias_value":"TZO4ZP6XPI3U","created_at":"2026-05-18T12:25:53.335082+00:00"},{"alias_kind":"pith_short_16","alias_value":"TZO4ZP6XPI3UVSQ6","created_at":"2026-05-18T12:25:53.335082+00:00"},{"alias_kind":"pith_short_8","alias_value":"TZO4ZP6X","created_at":"2026-05-18T12:25:53.335082+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TZO4ZP6XPI3UVSQ62IZ7SGJZ2M","json":"https://pith.science/pith/TZO4ZP6XPI3UVSQ62IZ7SGJZ2M.json","graph_json":"https://pith.science/api/pith-number/TZO4ZP6XPI3UVSQ62IZ7SGJZ2M/graph.json","events_json":"https://pith.science/api/pith-number/TZO4ZP6XPI3UVSQ62IZ7SGJZ2M/events.json","paper":"https://pith.science/paper/TZO4ZP6X"},"agent_actions":{"view_html":"https://pith.science/pith/TZO4ZP6XPI3UVSQ62IZ7SGJZ2M","download_json":"https://pith.science/pith/TZO4ZP6XPI3UVSQ62IZ7SGJZ2M.json","view_paper":"https://pith.science/paper/TZO4ZP6X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0510463&json=true","fetch_graph":"https://pith.science/api/pith-number/TZO4ZP6XPI3UVSQ62IZ7SGJZ2M/graph.json","fetch_events":"https://pith.science/api/pith-number/TZO4ZP6XPI3UVSQ62IZ7SGJZ2M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TZO4ZP6XPI3UVSQ62IZ7SGJZ2M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TZO4ZP6XPI3UVSQ62IZ7SGJZ2M/action/storage_attestation","attest_author":"https://pith.science/pith/TZO4ZP6XPI3UVSQ62IZ7SGJZ2M/action/author_attestation","sign_citation":"https://pith.science/pith/TZO4ZP6XPI3UVSQ62IZ7SGJZ2M/action/citation_signature","submit_replication":"https://pith.science/pith/TZO4ZP6XPI3UVSQ62IZ7SGJZ2M/action/replication_record"}},"created_at":"2026-05-18T04:35:57.844156+00:00","updated_at":"2026-05-18T04:35:57.844156+00:00"}