{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:OCZABDPBVKPJUDB3QZF5WQWATL","short_pith_number":"pith:OCZABDPB","schema_version":"1.0","canonical_sha256":"70b2008de1aa9e9a0c3b864bdb42c09aed483557fb5a39f1c1fc7f7138fec45c","source":{"kind":"arxiv","id":"1402.4627","version":1},"attestation_state":"computed","paper":{"title":"Maximally connected and super arc-connected Bi-Cayley digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jixiang Meng, Yuhu Liu","submitted_at":"2014-02-19T11:37:26Z","abstract_excerpt":"Let X=(V, E) be a digraph. X is maximally connected, if \\kappa(X)=\\delta(X). X is maximally arc-connected, if \\lambda(X)=\\delta(X). And X is super arc-connected, if every minimum arc-cut of X is either the set of inarcs of some vertex or the set of outarcs of some vertex. In this paper, we will prove that the strongly connected Bi-Cayley digraphs are maximally connected and maximally arc-connected, and the most of strongly connected Bi-Cayley digraphs are super arc-connected."},"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":"1402.4627","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-02-19T11:37:26Z","cross_cats_sorted":[],"title_canon_sha256":"a5894e6873ba0551a2ceac217a5f06f40c64a88054b8efd93261af17c830c004","abstract_canon_sha256":"9a3d6bada1aae69e9ee7197888d511845179d5fda353c63bfa4cb90294face44"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:58:33.619580Z","signature_b64":"6VGE2Vxu+w4+dipqzRcO6K3307umELBkVVG2jO27FspBvexk4oxmhrmb5W9uXB4G5GAS6PT2ZJk1h9PKufvjBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"70b2008de1aa9e9a0c3b864bdb42c09aed483557fb5a39f1c1fc7f7138fec45c","last_reissued_at":"2026-05-18T02:58:33.618675Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:58:33.618675Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Maximally connected and super arc-connected Bi-Cayley digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jixiang Meng, Yuhu Liu","submitted_at":"2014-02-19T11:37:26Z","abstract_excerpt":"Let X=(V, E) be a digraph. X is maximally connected, if \\kappa(X)=\\delta(X). X is maximally arc-connected, if \\lambda(X)=\\delta(X). And X is super arc-connected, if every minimum arc-cut of X is either the set of inarcs of some vertex or the set of outarcs of some vertex. In this paper, we will prove that the strongly connected Bi-Cayley digraphs are maximally connected and maximally arc-connected, and the most of strongly connected Bi-Cayley digraphs are super arc-connected."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.4627","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":"1402.4627","created_at":"2026-05-18T02:58:33.618831+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.4627v1","created_at":"2026-05-18T02:58:33.618831+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.4627","created_at":"2026-05-18T02:58:33.618831+00:00"},{"alias_kind":"pith_short_12","alias_value":"OCZABDPBVKPJ","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_16","alias_value":"OCZABDPBVKPJUDB3","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_8","alias_value":"OCZABDPB","created_at":"2026-05-18T12:28:41.024544+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/OCZABDPBVKPJUDB3QZF5WQWATL","json":"https://pith.science/pith/OCZABDPBVKPJUDB3QZF5WQWATL.json","graph_json":"https://pith.science/api/pith-number/OCZABDPBVKPJUDB3QZF5WQWATL/graph.json","events_json":"https://pith.science/api/pith-number/OCZABDPBVKPJUDB3QZF5WQWATL/events.json","paper":"https://pith.science/paper/OCZABDPB"},"agent_actions":{"view_html":"https://pith.science/pith/OCZABDPBVKPJUDB3QZF5WQWATL","download_json":"https://pith.science/pith/OCZABDPBVKPJUDB3QZF5WQWATL.json","view_paper":"https://pith.science/paper/OCZABDPB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.4627&json=true","fetch_graph":"https://pith.science/api/pith-number/OCZABDPBVKPJUDB3QZF5WQWATL/graph.json","fetch_events":"https://pith.science/api/pith-number/OCZABDPBVKPJUDB3QZF5WQWATL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OCZABDPBVKPJUDB3QZF5WQWATL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OCZABDPBVKPJUDB3QZF5WQWATL/action/storage_attestation","attest_author":"https://pith.science/pith/OCZABDPBVKPJUDB3QZF5WQWATL/action/author_attestation","sign_citation":"https://pith.science/pith/OCZABDPBVKPJUDB3QZF5WQWATL/action/citation_signature","submit_replication":"https://pith.science/pith/OCZABDPBVKPJUDB3QZF5WQWATL/action/replication_record"}},"created_at":"2026-05-18T02:58:33.618831+00:00","updated_at":"2026-05-18T02:58:33.618831+00:00"}