{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:XARZJKSNTL77VOAU2PG3MVFYVE","short_pith_number":"pith:XARZJKSN","schema_version":"1.0","canonical_sha256":"b82394aa4d9afffab814d3cdb654b8a91c03ff8a0bb2e4f5b7ae480b15a1d0ad","source":{"kind":"arxiv","id":"1608.05729","version":2},"attestation_state":"computed","paper":{"title":"Supermodularity in Unweighted Graph Opitimization III: Highly-connected Digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Andr\\'as Frank, Krist\\'of B\\'erczi","submitted_at":"2016-08-19T20:21:07Z","abstract_excerpt":"By generalizing a recent result of Hong, Liu, and Lai on characterizing the degree-sequences of simple strongly connected directed graphs, a characterization is provided for degree-sequences of simple $k$-node-connected digraphs. More generally, we solve the directed node-connectivity augmentation problem when the augmented digraph is degree-specified and simple. As for edge-connectivity augmentation, we solve the special case when the edge-connectivity is to be increased by one and the augmenting digraph must be simple."},"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":"1608.05729","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-19T20:21:07Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"26d7b93898a90e25074d2f230c3fe2ac029454f2dec4a95245a3302f2eebfb73","abstract_canon_sha256":"1387dd2cd364a6b917d879ff399aac7b812ec00a9a0446b75c8578e412473404"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:09.637371Z","signature_b64":"6RQpLAOCtRahLjVojFQ+3oOPar0uZHVrVBgufCI2yKEzXpg5ctAJXRw/qUodhJQ0+cCnGKEXgR18dP3QxDJABw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b82394aa4d9afffab814d3cdb654b8a91c03ff8a0bb2e4f5b7ae480b15a1d0ad","last_reissued_at":"2026-05-18T00:36:09.636719Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:09.636719Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Supermodularity in Unweighted Graph Opitimization III: Highly-connected Digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Andr\\'as Frank, Krist\\'of B\\'erczi","submitted_at":"2016-08-19T20:21:07Z","abstract_excerpt":"By generalizing a recent result of Hong, Liu, and Lai on characterizing the degree-sequences of simple strongly connected directed graphs, a characterization is provided for degree-sequences of simple $k$-node-connected digraphs. More generally, we solve the directed node-connectivity augmentation problem when the augmented digraph is degree-specified and simple. As for edge-connectivity augmentation, we solve the special case when the edge-connectivity is to be increased by one and the augmenting digraph must be simple."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.05729","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":"1608.05729","created_at":"2026-05-18T00:36:09.636811+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.05729v2","created_at":"2026-05-18T00:36:09.636811+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.05729","created_at":"2026-05-18T00:36:09.636811+00:00"},{"alias_kind":"pith_short_12","alias_value":"XARZJKSNTL77","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_16","alias_value":"XARZJKSNTL77VOAU","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_8","alias_value":"XARZJKSN","created_at":"2026-05-18T12:30:51.357362+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/XARZJKSNTL77VOAU2PG3MVFYVE","json":"https://pith.science/pith/XARZJKSNTL77VOAU2PG3MVFYVE.json","graph_json":"https://pith.science/api/pith-number/XARZJKSNTL77VOAU2PG3MVFYVE/graph.json","events_json":"https://pith.science/api/pith-number/XARZJKSNTL77VOAU2PG3MVFYVE/events.json","paper":"https://pith.science/paper/XARZJKSN"},"agent_actions":{"view_html":"https://pith.science/pith/XARZJKSNTL77VOAU2PG3MVFYVE","download_json":"https://pith.science/pith/XARZJKSNTL77VOAU2PG3MVFYVE.json","view_paper":"https://pith.science/paper/XARZJKSN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.05729&json=true","fetch_graph":"https://pith.science/api/pith-number/XARZJKSNTL77VOAU2PG3MVFYVE/graph.json","fetch_events":"https://pith.science/api/pith-number/XARZJKSNTL77VOAU2PG3MVFYVE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XARZJKSNTL77VOAU2PG3MVFYVE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XARZJKSNTL77VOAU2PG3MVFYVE/action/storage_attestation","attest_author":"https://pith.science/pith/XARZJKSNTL77VOAU2PG3MVFYVE/action/author_attestation","sign_citation":"https://pith.science/pith/XARZJKSNTL77VOAU2PG3MVFYVE/action/citation_signature","submit_replication":"https://pith.science/pith/XARZJKSNTL77VOAU2PG3MVFYVE/action/replication_record"}},"created_at":"2026-05-18T00:36:09.636811+00:00","updated_at":"2026-05-18T00:36:09.636811+00:00"}