{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:AJSKUV4MCDPOJFIWXPVPWAY7WO","short_pith_number":"pith:AJSKUV4M","schema_version":"1.0","canonical_sha256":"0264aa578c10dee49516bbeafb031fb39438e35ac880072fc4005f12f1f48eff","source":{"kind":"arxiv","id":"1702.01253","version":1},"attestation_state":"computed","paper":{"title":"Minimum edge cuts of distance-regular and strongly regular digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"F. Shafiei, G.R. Omidi, K. Tajbakhsh, S. Ashkboos","submitted_at":"2017-02-04T08:25:37Z","abstract_excerpt":"In this paper, we show that the edge connectivity of a distance-regular digraph $\\Gamma$ with valency $k$ is $k$ and for $k>2$, any minimum edge cut of $\\Gamma$ is the set of all edges going into (or coming out of) a single vertex. Moreover we show that the same result holds for strongly regular digraphs. These results extend the same known results for undirected case with quite different proofs."},"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":"1702.01253","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-04T08:25:37Z","cross_cats_sorted":[],"title_canon_sha256":"7f9cfce011e91f2842a9de24fd734cc2acdb8c4cd25a4c41649cd685c5e37db9","abstract_canon_sha256":"7615f4376d93e62f92426946a0b19eebddb714954e1eb3dc5fbf94ebf8b26a38"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:24.004562Z","signature_b64":"nmwSNgf4hIzdCVGhKXYWpwxQZToPKH7r7eLeRiJ0aZ6T99oh7W1tTebTLwL3+XJSU/5h3u7uqxUmn7FLNZLlAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0264aa578c10dee49516bbeafb031fb39438e35ac880072fc4005f12f1f48eff","last_reissued_at":"2026-05-18T00:51:24.004073Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:24.004073Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimum edge cuts of distance-regular and strongly regular digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"F. Shafiei, G.R. Omidi, K. Tajbakhsh, S. Ashkboos","submitted_at":"2017-02-04T08:25:37Z","abstract_excerpt":"In this paper, we show that the edge connectivity of a distance-regular digraph $\\Gamma$ with valency $k$ is $k$ and for $k>2$, any minimum edge cut of $\\Gamma$ is the set of all edges going into (or coming out of) a single vertex. Moreover we show that the same result holds for strongly regular digraphs. These results extend the same known results for undirected case with quite different proofs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.01253","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":"1702.01253","created_at":"2026-05-18T00:51:24.004137+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.01253v1","created_at":"2026-05-18T00:51:24.004137+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.01253","created_at":"2026-05-18T00:51:24.004137+00:00"},{"alias_kind":"pith_short_12","alias_value":"AJSKUV4MCDPO","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"AJSKUV4MCDPOJFIW","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"AJSKUV4M","created_at":"2026-05-18T12:31:05.417338+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/AJSKUV4MCDPOJFIWXPVPWAY7WO","json":"https://pith.science/pith/AJSKUV4MCDPOJFIWXPVPWAY7WO.json","graph_json":"https://pith.science/api/pith-number/AJSKUV4MCDPOJFIWXPVPWAY7WO/graph.json","events_json":"https://pith.science/api/pith-number/AJSKUV4MCDPOJFIWXPVPWAY7WO/events.json","paper":"https://pith.science/paper/AJSKUV4M"},"agent_actions":{"view_html":"https://pith.science/pith/AJSKUV4MCDPOJFIWXPVPWAY7WO","download_json":"https://pith.science/pith/AJSKUV4MCDPOJFIWXPVPWAY7WO.json","view_paper":"https://pith.science/paper/AJSKUV4M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.01253&json=true","fetch_graph":"https://pith.science/api/pith-number/AJSKUV4MCDPOJFIWXPVPWAY7WO/graph.json","fetch_events":"https://pith.science/api/pith-number/AJSKUV4MCDPOJFIWXPVPWAY7WO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AJSKUV4MCDPOJFIWXPVPWAY7WO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AJSKUV4MCDPOJFIWXPVPWAY7WO/action/storage_attestation","attest_author":"https://pith.science/pith/AJSKUV4MCDPOJFIWXPVPWAY7WO/action/author_attestation","sign_citation":"https://pith.science/pith/AJSKUV4MCDPOJFIWXPVPWAY7WO/action/citation_signature","submit_replication":"https://pith.science/pith/AJSKUV4MCDPOJFIWXPVPWAY7WO/action/replication_record"}},"created_at":"2026-05-18T00:51:24.004137+00:00","updated_at":"2026-05-18T00:51:24.004137+00:00"}