{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:4PJ4NTGMKLSCO3D24LKEC7YH54","short_pith_number":"pith:4PJ4NTGM","schema_version":"1.0","canonical_sha256":"e3d3c6cccc52e4276c7ae2d4417f07ef107de3fe1f9ca39d9cbecd1fb20b5315","source":{"kind":"arxiv","id":"2507.22388","version":3},"attestation_state":"computed","paper":{"title":"An equality for balanced digraphs","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benjamin Liber, Darij Grinberg","submitted_at":"2025-07-30T05:21:45Z","abstract_excerpt":"Consider a directed multigraph $D$ that is balanced (i.e., at each vertex, the indegree equals the outdegree). Let $A$ be its set of arcs. Fix an integer $k$. Let $s$ be a vertex of $D$. We show that the number of $k$-element subsets $B$ of $A$ that contain no cycles but contain a path from each vertex to $s$ (we call them \"$s$-convergences\") is independent on $s$. This generalizes known facts about spanning arborescences, acyclic orientations and maximal acyclic subdigraphs (or, equivalently, minimum feedback arc sets). Moreover, this result can be generalized even further, replacing \"contain"},"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":"2507.22388","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.CO","submitted_at":"2025-07-30T05:21:45Z","cross_cats_sorted":[],"title_canon_sha256":"51d32b9c0b804be22f77db1156d7f4f9061ac5789f5edc07f1696a3b1422decb","abstract_canon_sha256":"306cabfef7a34698867edddedf816ca2684d44e6e398401a2ccf7e17da4d6362"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-23T02:13:16.237442Z","signature_b64":"AyoEcH5B35bd5r9u8FH2Grj5GDSMEXHEGwp4OLboYu+Z+cGXaU6yEZqDy5Ba7dt46Ak0JCNhGUX3LmaWjQGNCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e3d3c6cccc52e4276c7ae2d4417f07ef107de3fe1f9ca39d9cbecd1fb20b5315","last_reissued_at":"2026-06-23T02:13:16.236973Z","signature_status":"signed_v1","first_computed_at":"2026-06-23T02:13:16.236973Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An equality for balanced digraphs","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benjamin Liber, Darij Grinberg","submitted_at":"2025-07-30T05:21:45Z","abstract_excerpt":"Consider a directed multigraph $D$ that is balanced (i.e., at each vertex, the indegree equals the outdegree). Let $A$ be its set of arcs. Fix an integer $k$. Let $s$ be a vertex of $D$. We show that the number of $k$-element subsets $B$ of $A$ that contain no cycles but contain a path from each vertex to $s$ (we call them \"$s$-convergences\") is independent on $s$. This generalizes known facts about spanning arborescences, acyclic orientations and maximal acyclic subdigraphs (or, equivalently, minimum feedback arc sets). Moreover, this result can be generalized even further, replacing \"contain"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.22388","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2507.22388/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2507.22388","created_at":"2026-06-23T02:13:16.237032+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.22388v3","created_at":"2026-06-23T02:13:16.237032+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.22388","created_at":"2026-06-23T02:13:16.237032+00:00"},{"alias_kind":"pith_short_12","alias_value":"4PJ4NTGMKLSC","created_at":"2026-06-23T02:13:16.237032+00:00"},{"alias_kind":"pith_short_16","alias_value":"4PJ4NTGMKLSCO3D2","created_at":"2026-06-23T02:13:16.237032+00:00"},{"alias_kind":"pith_short_8","alias_value":"4PJ4NTGM","created_at":"2026-06-23T02:13:16.237032+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/4PJ4NTGMKLSCO3D24LKEC7YH54","json":"https://pith.science/pith/4PJ4NTGMKLSCO3D24LKEC7YH54.json","graph_json":"https://pith.science/api/pith-number/4PJ4NTGMKLSCO3D24LKEC7YH54/graph.json","events_json":"https://pith.science/api/pith-number/4PJ4NTGMKLSCO3D24LKEC7YH54/events.json","paper":"https://pith.science/paper/4PJ4NTGM"},"agent_actions":{"view_html":"https://pith.science/pith/4PJ4NTGMKLSCO3D24LKEC7YH54","download_json":"https://pith.science/pith/4PJ4NTGMKLSCO3D24LKEC7YH54.json","view_paper":"https://pith.science/paper/4PJ4NTGM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.22388&json=true","fetch_graph":"https://pith.science/api/pith-number/4PJ4NTGMKLSCO3D24LKEC7YH54/graph.json","fetch_events":"https://pith.science/api/pith-number/4PJ4NTGMKLSCO3D24LKEC7YH54/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4PJ4NTGMKLSCO3D24LKEC7YH54/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4PJ4NTGMKLSCO3D24LKEC7YH54/action/storage_attestation","attest_author":"https://pith.science/pith/4PJ4NTGMKLSCO3D24LKEC7YH54/action/author_attestation","sign_citation":"https://pith.science/pith/4PJ4NTGMKLSCO3D24LKEC7YH54/action/citation_signature","submit_replication":"https://pith.science/pith/4PJ4NTGMKLSCO3D24LKEC7YH54/action/replication_record"}},"created_at":"2026-06-23T02:13:16.237032+00:00","updated_at":"2026-06-23T02:13:16.237032+00:00"}