{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:JBZM7I2HDRC77PINIZCSJYTCQR","short_pith_number":"pith:JBZM7I2H","schema_version":"1.0","canonical_sha256":"4872cfa3471c45ffbd0d464524e262846be49102b569fd73eeb14af75e62c133","source":{"kind":"arxiv","id":"1301.4639","version":1},"attestation_state":"computed","paper":{"title":"Vulnerability of super edge-connected graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jun-Ming Xu, Zhen-Mu Hong","submitted_at":"2013-01-20T08:25:43Z","abstract_excerpt":"A subset $F$ of edges in a connected graph $G$ is a $h$-extra edge-cut if $G-F$ is disconnected and every component has more than $h$ vertices. The $h$-extra edge-connectivity $\\la^{(h)}(G)$ of $G$ is defined as the minimum cardinality over all $h$-extra edge-cuts of $G$. A graph $G$, if $\\la^{(h)}(G)$ exists, is super-$\\la^{(h)}$ if every minimum $h$-extra edge-cut of $G$ isolates at least one connected subgraph of order $h+1$. The persistence $\\rho^{(h)}(G)$ of a super-$\\la^{(h)}$ graph $G$ is the maximum integer $m$ for which $G-F$ is still super-$\\la^{(h)}$ for any set $F\\subseteq E(G)$ wi"},"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":"1301.4639","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-01-20T08:25:43Z","cross_cats_sorted":[],"title_canon_sha256":"55996f8931924a9c7321deb10186a698976eb89821599533b591ca1cb46567a5","abstract_canon_sha256":"0d20638dfe48706d670e0e537db3f1b838142cfc78d1e7e2f5ce1e3826060b37"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:35:56.073341Z","signature_b64":"2bnSdi8M/orDWRPeV22ynDgRZB7hJd9atZ0YD1pKXkeCBfM538YuRn91IrGacl0vKtLRTETaAV+5/qmfHyZVDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4872cfa3471c45ffbd0d464524e262846be49102b569fd73eeb14af75e62c133","last_reissued_at":"2026-05-18T03:35:56.072739Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:35:56.072739Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Vulnerability of super edge-connected graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jun-Ming Xu, Zhen-Mu Hong","submitted_at":"2013-01-20T08:25:43Z","abstract_excerpt":"A subset $F$ of edges in a connected graph $G$ is a $h$-extra edge-cut if $G-F$ is disconnected and every component has more than $h$ vertices. The $h$-extra edge-connectivity $\\la^{(h)}(G)$ of $G$ is defined as the minimum cardinality over all $h$-extra edge-cuts of $G$. A graph $G$, if $\\la^{(h)}(G)$ exists, is super-$\\la^{(h)}$ if every minimum $h$-extra edge-cut of $G$ isolates at least one connected subgraph of order $h+1$. The persistence $\\rho^{(h)}(G)$ of a super-$\\la^{(h)}$ graph $G$ is the maximum integer $m$ for which $G-F$ is still super-$\\la^{(h)}$ for any set $F\\subseteq E(G)$ wi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.4639","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":"1301.4639","created_at":"2026-05-18T03:35:56.072837+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.4639v1","created_at":"2026-05-18T03:35:56.072837+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.4639","created_at":"2026-05-18T03:35:56.072837+00:00"},{"alias_kind":"pith_short_12","alias_value":"JBZM7I2HDRC7","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_16","alias_value":"JBZM7I2HDRC77PIN","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_8","alias_value":"JBZM7I2H","created_at":"2026-05-18T12:27:49.015174+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/JBZM7I2HDRC77PINIZCSJYTCQR","json":"https://pith.science/pith/JBZM7I2HDRC77PINIZCSJYTCQR.json","graph_json":"https://pith.science/api/pith-number/JBZM7I2HDRC77PINIZCSJYTCQR/graph.json","events_json":"https://pith.science/api/pith-number/JBZM7I2HDRC77PINIZCSJYTCQR/events.json","paper":"https://pith.science/paper/JBZM7I2H"},"agent_actions":{"view_html":"https://pith.science/pith/JBZM7I2HDRC77PINIZCSJYTCQR","download_json":"https://pith.science/pith/JBZM7I2HDRC77PINIZCSJYTCQR.json","view_paper":"https://pith.science/paper/JBZM7I2H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.4639&json=true","fetch_graph":"https://pith.science/api/pith-number/JBZM7I2HDRC77PINIZCSJYTCQR/graph.json","fetch_events":"https://pith.science/api/pith-number/JBZM7I2HDRC77PINIZCSJYTCQR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JBZM7I2HDRC77PINIZCSJYTCQR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JBZM7I2HDRC77PINIZCSJYTCQR/action/storage_attestation","attest_author":"https://pith.science/pith/JBZM7I2HDRC77PINIZCSJYTCQR/action/author_attestation","sign_citation":"https://pith.science/pith/JBZM7I2HDRC77PINIZCSJYTCQR/action/citation_signature","submit_replication":"https://pith.science/pith/JBZM7I2HDRC77PINIZCSJYTCQR/action/replication_record"}},"created_at":"2026-05-18T03:35:56.072837+00:00","updated_at":"2026-05-18T03:35:56.072837+00:00"}