{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:3AUVPN3AZSMQI37CLSUDGKOM2T","short_pith_number":"pith:3AUVPN3A","schema_version":"1.0","canonical_sha256":"d82957b760cc99046fe25ca83329ccd4d98112093e96166e378b2a1ce8921c07","source":{"kind":"arxiv","id":"1306.3480","version":2},"attestation_state":"computed","paper":{"title":"A Faster Algorithm for Packing Branchings in Digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Mario Leston Rey, Orlando Lee","submitted_at":"2013-06-14T18:42:35Z","abstract_excerpt":"We consider the problem of finding an integral packing of branchings in a capacitated digraph with root-set demands. Schrijver described an algorithm that returns a packing with at most m+n^3+r branchings that makes at most m(m+n^3+r) calls to an oracle that basically computes a minimum cut, where n is the number of vertices, m is the number of arcs and r is the number of root-sets of the input digraph. In this work we provide an algorithm, inspired on ideas of Schrijver and on an paper of Gabow and Manu, that returns a packing with at most m+r-1 branchings and makes at most 2n+m+r-1 oracle ca"},"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":"1306.3480","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-06-14T18:42:35Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"b672f1b968f4ba617951b1f984c5ec6c7482d6d2f91f0d92f8522ac9714a1734","abstract_canon_sha256":"c7d820d45ec401f4e91f4a2f0e1919dacfa48ae57fa3fd223c513c8eb4bd6509"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:17:44.089148Z","signature_b64":"FXGXS7bAj2JbVQ/8fsjciMz95tPZrdI4pMfYzvNth7G7fJlHksNKcW9LdQSuSnia6xoYKfTg79NlQOL4M71NCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d82957b760cc99046fe25ca83329ccd4d98112093e96166e378b2a1ce8921c07","last_reissued_at":"2026-05-18T03:17:44.088473Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:17:44.088473Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Faster Algorithm for Packing Branchings in Digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Mario Leston Rey, Orlando Lee","submitted_at":"2013-06-14T18:42:35Z","abstract_excerpt":"We consider the problem of finding an integral packing of branchings in a capacitated digraph with root-set demands. Schrijver described an algorithm that returns a packing with at most m+n^3+r branchings that makes at most m(m+n^3+r) calls to an oracle that basically computes a minimum cut, where n is the number of vertices, m is the number of arcs and r is the number of root-sets of the input digraph. In this work we provide an algorithm, inspired on ideas of Schrijver and on an paper of Gabow and Manu, that returns a packing with at most m+r-1 branchings and makes at most 2n+m+r-1 oracle ca"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.3480","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1306.3480","created_at":"2026-05-18T03:17:44.088563+00:00"},{"alias_kind":"arxiv_version","alias_value":"1306.3480v2","created_at":"2026-05-18T03:17:44.088563+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.3480","created_at":"2026-05-18T03:17:44.088563+00:00"},{"alias_kind":"pith_short_12","alias_value":"3AUVPN3AZSMQ","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_16","alias_value":"3AUVPN3AZSMQI37C","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_8","alias_value":"3AUVPN3A","created_at":"2026-05-18T12:27:32.513160+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/3AUVPN3AZSMQI37CLSUDGKOM2T","json":"https://pith.science/pith/3AUVPN3AZSMQI37CLSUDGKOM2T.json","graph_json":"https://pith.science/api/pith-number/3AUVPN3AZSMQI37CLSUDGKOM2T/graph.json","events_json":"https://pith.science/api/pith-number/3AUVPN3AZSMQI37CLSUDGKOM2T/events.json","paper":"https://pith.science/paper/3AUVPN3A"},"agent_actions":{"view_html":"https://pith.science/pith/3AUVPN3AZSMQI37CLSUDGKOM2T","download_json":"https://pith.science/pith/3AUVPN3AZSMQI37CLSUDGKOM2T.json","view_paper":"https://pith.science/paper/3AUVPN3A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1306.3480&json=true","fetch_graph":"https://pith.science/api/pith-number/3AUVPN3AZSMQI37CLSUDGKOM2T/graph.json","fetch_events":"https://pith.science/api/pith-number/3AUVPN3AZSMQI37CLSUDGKOM2T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3AUVPN3AZSMQI37CLSUDGKOM2T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3AUVPN3AZSMQI37CLSUDGKOM2T/action/storage_attestation","attest_author":"https://pith.science/pith/3AUVPN3AZSMQI37CLSUDGKOM2T/action/author_attestation","sign_citation":"https://pith.science/pith/3AUVPN3AZSMQI37CLSUDGKOM2T/action/citation_signature","submit_replication":"https://pith.science/pith/3AUVPN3AZSMQI37CLSUDGKOM2T/action/replication_record"}},"created_at":"2026-05-18T03:17:44.088563+00:00","updated_at":"2026-05-18T03:17:44.088563+00:00"}