{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:XGZMOQ67EMKR443BALYFK75XSJ","short_pith_number":"pith:XGZMOQ67","schema_version":"1.0","canonical_sha256":"b9b2c743df23151e736102f0557fb792794c25b3835698b57b5f715e46f0bb94","source":{"kind":"arxiv","id":"2412.00337","version":1},"attestation_state":"computed","paper":{"title":"Revisiting Extremal Graphs Having No Stable Cutsets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dieter Rautenbach, Johannes Rauch","submitted_at":"2024-11-30T03:29:06Z","abstract_excerpt":"Confirming a conjecture posed by Caro, it was shown by Chen and Yu that every graph $G$ with $n$ vertices and at most $2n-4$ edges has a stable cutset, which is a stable set of vertices whose removal disconnects the graph. Le and Pfender showed that all graphs with $n$ vertices and $2n-3$ edges without stable cutset arise recursively glueing together triangles and triangular prisms along an edge or triangle. Le and Pfender's proof contains a gap, which we fill in the present article."},"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":"2412.00337","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-11-30T03:29:06Z","cross_cats_sorted":[],"title_canon_sha256":"dfa839db7feb6077b65fb8d3c906daaf5891f0bf325d1818bda038c03e7105f4","abstract_canon_sha256":"b4e68cd0832a0f3c4d3e629b59f3e4071931b77120aa2d5d09a5937ceaa5016e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:42:39.802760Z","signature_b64":"wwVqrvkufhw40F/MDyu7xRFuHA0KCNaxFOeu9ENZXC1Bmdph54l30O3k/WjZRhfI0fCkE0KemLBMU5EAPbQUDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b9b2c743df23151e736102f0557fb792794c25b3835698b57b5f715e46f0bb94","last_reissued_at":"2026-07-05T09:42:39.802265Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:42:39.802265Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Revisiting Extremal Graphs Having No Stable Cutsets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dieter Rautenbach, Johannes Rauch","submitted_at":"2024-11-30T03:29:06Z","abstract_excerpt":"Confirming a conjecture posed by Caro, it was shown by Chen and Yu that every graph $G$ with $n$ vertices and at most $2n-4$ edges has a stable cutset, which is a stable set of vertices whose removal disconnects the graph. Le and Pfender showed that all graphs with $n$ vertices and $2n-3$ edges without stable cutset arise recursively glueing together triangles and triangular prisms along an edge or triangle. Le and Pfender's proof contains a gap, which we fill in the present article."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.00337","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2412.00337/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2412.00337","created_at":"2026-07-05T09:42:39.802337+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.00337v1","created_at":"2026-07-05T09:42:39.802337+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.00337","created_at":"2026-07-05T09:42:39.802337+00:00"},{"alias_kind":"pith_short_12","alias_value":"XGZMOQ67EMKR","created_at":"2026-07-05T09:42:39.802337+00:00"},{"alias_kind":"pith_short_16","alias_value":"XGZMOQ67EMKR443B","created_at":"2026-07-05T09:42:39.802337+00:00"},{"alias_kind":"pith_short_8","alias_value":"XGZMOQ67","created_at":"2026-07-05T09:42:39.802337+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2412.16018","citing_title":"Stable cuts, NAC-colourings and flexible realisations of graphs","ref_index":26,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XGZMOQ67EMKR443BALYFK75XSJ","json":"https://pith.science/pith/XGZMOQ67EMKR443BALYFK75XSJ.json","graph_json":"https://pith.science/api/pith-number/XGZMOQ67EMKR443BALYFK75XSJ/graph.json","events_json":"https://pith.science/api/pith-number/XGZMOQ67EMKR443BALYFK75XSJ/events.json","paper":"https://pith.science/paper/XGZMOQ67"},"agent_actions":{"view_html":"https://pith.science/pith/XGZMOQ67EMKR443BALYFK75XSJ","download_json":"https://pith.science/pith/XGZMOQ67EMKR443BALYFK75XSJ.json","view_paper":"https://pith.science/paper/XGZMOQ67","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.00337&json=true","fetch_graph":"https://pith.science/api/pith-number/XGZMOQ67EMKR443BALYFK75XSJ/graph.json","fetch_events":"https://pith.science/api/pith-number/XGZMOQ67EMKR443BALYFK75XSJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XGZMOQ67EMKR443BALYFK75XSJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XGZMOQ67EMKR443BALYFK75XSJ/action/storage_attestation","attest_author":"https://pith.science/pith/XGZMOQ67EMKR443BALYFK75XSJ/action/author_attestation","sign_citation":"https://pith.science/pith/XGZMOQ67EMKR443BALYFK75XSJ/action/citation_signature","submit_replication":"https://pith.science/pith/XGZMOQ67EMKR443BALYFK75XSJ/action/replication_record"}},"created_at":"2026-07-05T09:42:39.802337+00:00","updated_at":"2026-07-05T09:42:39.802337+00:00"}