{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:2RLQVY7QCXL7PGGLGRPVG3HMA7","short_pith_number":"pith:2RLQVY7Q","schema_version":"1.0","canonical_sha256":"d4570ae3f015d7f798cb345f536cec07f8b52242f6fa0af1746bc07fafc3b3ad","source":{"kind":"arxiv","id":"1803.01312","version":1},"attestation_state":"computed","paper":{"title":"Component edge connectivity of the folded hypercube","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Shuli Zhao, Weihua Yang","submitted_at":"2018-03-04T07:33:50Z","abstract_excerpt":"The $g$-component edge connectivity $c\\lambda_g(G)$ of a non-complete graph $G$ is the minimum number of edges whose deletion results in a graph with at least $g$ components. In this paper, we determine the component edge connectivity of the folded hypercube $c\\lambda_{g+1}(FQ_{n})=(n+1)g-(\\sum\\limits_{i=0}^{s}t_i2^{t_i-1}+\\sum\\limits_{i=0}^{s} i\\cdot 2^{t_i})$ for $g\\leq 2^{[\\frac{n+1}2]}$ and $n\\geq 5$, where $g$ be a positive integer and $g=\\sum\\limits_{i=0}^{s}2^{t_i}$ be the decomposition of $g$ such that $t_0=[\\log_{2}{g}],$ and $t_i=[\\log_2({g-\\sum\\limits_{r=0}^{i-1}2^{t_r}})]$ for $i\\g"},"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":"1803.01312","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-04T07:33:50Z","cross_cats_sorted":[],"title_canon_sha256":"a678b3f59a2a2a0d8840edcc1c500d0736498885d46234cd424e0b2a7f1429e4","abstract_canon_sha256":"c2a1f5c0a509ebe990e7aef5f7826b52c3176bafc6455d43b2e2962fbb584b46"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:01.113133Z","signature_b64":"20OSQvisLFVE1AZRpHCVDg2uxqyFKySbiM+OiQRv1DaDzG9TY4S/md06BVocFQIdcM4jL/9Meap2HuR37GppCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d4570ae3f015d7f798cb345f536cec07f8b52242f6fa0af1746bc07fafc3b3ad","last_reissued_at":"2026-05-18T00:22:01.112641Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:01.112641Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Component edge connectivity of the folded hypercube","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Shuli Zhao, Weihua Yang","submitted_at":"2018-03-04T07:33:50Z","abstract_excerpt":"The $g$-component edge connectivity $c\\lambda_g(G)$ of a non-complete graph $G$ is the minimum number of edges whose deletion results in a graph with at least $g$ components. In this paper, we determine the component edge connectivity of the folded hypercube $c\\lambda_{g+1}(FQ_{n})=(n+1)g-(\\sum\\limits_{i=0}^{s}t_i2^{t_i-1}+\\sum\\limits_{i=0}^{s} i\\cdot 2^{t_i})$ for $g\\leq 2^{[\\frac{n+1}2]}$ and $n\\geq 5$, where $g$ be a positive integer and $g=\\sum\\limits_{i=0}^{s}2^{t_i}$ be the decomposition of $g$ such that $t_0=[\\log_{2}{g}],$ and $t_i=[\\log_2({g-\\sum\\limits_{r=0}^{i-1}2^{t_r}})]$ for $i\\g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.01312","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":"1803.01312","created_at":"2026-05-18T00:22:01.112705+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.01312v1","created_at":"2026-05-18T00:22:01.112705+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.01312","created_at":"2026-05-18T00:22:01.112705+00:00"},{"alias_kind":"pith_short_12","alias_value":"2RLQVY7QCXL7","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_16","alias_value":"2RLQVY7QCXL7PGGL","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_8","alias_value":"2RLQVY7Q","created_at":"2026-05-18T12:32:02.567920+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/2RLQVY7QCXL7PGGLGRPVG3HMA7","json":"https://pith.science/pith/2RLQVY7QCXL7PGGLGRPVG3HMA7.json","graph_json":"https://pith.science/api/pith-number/2RLQVY7QCXL7PGGLGRPVG3HMA7/graph.json","events_json":"https://pith.science/api/pith-number/2RLQVY7QCXL7PGGLGRPVG3HMA7/events.json","paper":"https://pith.science/paper/2RLQVY7Q"},"agent_actions":{"view_html":"https://pith.science/pith/2RLQVY7QCXL7PGGLGRPVG3HMA7","download_json":"https://pith.science/pith/2RLQVY7QCXL7PGGLGRPVG3HMA7.json","view_paper":"https://pith.science/paper/2RLQVY7Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.01312&json=true","fetch_graph":"https://pith.science/api/pith-number/2RLQVY7QCXL7PGGLGRPVG3HMA7/graph.json","fetch_events":"https://pith.science/api/pith-number/2RLQVY7QCXL7PGGLGRPVG3HMA7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2RLQVY7QCXL7PGGLGRPVG3HMA7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2RLQVY7QCXL7PGGLGRPVG3HMA7/action/storage_attestation","attest_author":"https://pith.science/pith/2RLQVY7QCXL7PGGLGRPVG3HMA7/action/author_attestation","sign_citation":"https://pith.science/pith/2RLQVY7QCXL7PGGLGRPVG3HMA7/action/citation_signature","submit_replication":"https://pith.science/pith/2RLQVY7QCXL7PGGLGRPVG3HMA7/action/replication_record"}},"created_at":"2026-05-18T00:22:01.112705+00:00","updated_at":"2026-05-18T00:22:01.112705+00:00"}