{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:XGZMOQ67EMKR443BALYFK75XSJ","short_pith_number":"pith:XGZMOQ67","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"},"canonical_sha256":"b9b2c743df23151e736102f0557fb792794c25b3835698b57b5f715e46f0bb94","source":{"kind":"arxiv","id":"2412.00337","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.00337","created_at":"2026-07-05T09:42:39Z"},{"alias_kind":"arxiv_version","alias_value":"2412.00337v1","created_at":"2026-07-05T09:42:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.00337","created_at":"2026-07-05T09:42:39Z"},{"alias_kind":"pith_short_12","alias_value":"XGZMOQ67EMKR","created_at":"2026-07-05T09:42:39Z"},{"alias_kind":"pith_short_16","alias_value":"XGZMOQ67EMKR443B","created_at":"2026-07-05T09:42:39Z"},{"alias_kind":"pith_short_8","alias_value":"XGZMOQ67","created_at":"2026-07-05T09:42:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:XGZMOQ67EMKR443BALYFK75XSJ","target":"record","payload":{"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"},"canonical_sha256":"b9b2c743df23151e736102f0557fb792794c25b3835698b57b5f715e46f0bb94","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"},"source_kind":"arxiv","source_id":"2412.00337","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T09:42:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/2MN5j3QZoJ5cfVwTt9W7zG+yM6bDrf80UNH1pd1cucPFjpKYlEacYJlpVS8hg4ZKM6zoT9sOVyrx8p4+gRXAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T13:52:21.217912Z"},"content_sha256":"0c42376ef5599d34c6013128331c54465c8b713d833c29b854adbb8dd0dbc9a1","schema_version":"1.0","event_id":"sha256:0c42376ef5599d34c6013128331c54465c8b713d833c29b854adbb8dd0dbc9a1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:XGZMOQ67EMKR443BALYFK75XSJ","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T09:42:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YfpPtwqBJUPQkjpwvLIJhxgnEDENYlyytwweGvsjsKHktsC77kvFddFunJuheZy0pNaG4XjswZcByBo28HfQAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T13:52:21.222158Z"},"content_sha256":"9b356daa017569e25b0ef90481fbe5d928dcc13028465a2c3f97068a7638e70f","schema_version":"1.0","event_id":"sha256:9b356daa017569e25b0ef90481fbe5d928dcc13028465a2c3f97068a7638e70f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XGZMOQ67EMKR443BALYFK75XSJ/bundle.json","state_url":"https://pith.science/pith/XGZMOQ67EMKR443BALYFK75XSJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XGZMOQ67EMKR443BALYFK75XSJ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-13T13:52:21Z","links":{"resolver":"https://pith.science/pith/XGZMOQ67EMKR443BALYFK75XSJ","bundle":"https://pith.science/pith/XGZMOQ67EMKR443BALYFK75XSJ/bundle.json","state":"https://pith.science/pith/XGZMOQ67EMKR443BALYFK75XSJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XGZMOQ67EMKR443BALYFK75XSJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:XGZMOQ67EMKR443BALYFK75XSJ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"b4e68cd0832a0f3c4d3e629b59f3e4071931b77120aa2d5d09a5937ceaa5016e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-11-30T03:29:06Z","title_canon_sha256":"dfa839db7feb6077b65fb8d3c906daaf5891f0bf325d1818bda038c03e7105f4"},"schema_version":"1.0","source":{"id":"2412.00337","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.00337","created_at":"2026-07-05T09:42:39Z"},{"alias_kind":"arxiv_version","alias_value":"2412.00337v1","created_at":"2026-07-05T09:42:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.00337","created_at":"2026-07-05T09:42:39Z"},{"alias_kind":"pith_short_12","alias_value":"XGZMOQ67EMKR","created_at":"2026-07-05T09:42:39Z"},{"alias_kind":"pith_short_16","alias_value":"XGZMOQ67EMKR443B","created_at":"2026-07-05T09:42:39Z"},{"alias_kind":"pith_short_8","alias_value":"XGZMOQ67","created_at":"2026-07-05T09:42:39Z"}],"graph_snapshots":[{"event_id":"sha256:9b356daa017569e25b0ef90481fbe5d928dcc13028465a2c3f97068a7638e70f","target":"graph","created_at":"2026-07-05T09:42:39Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2412.00337/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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.","authors_text":"Dieter Rautenbach, Johannes Rauch","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-11-30T03:29:06Z","title":"Revisiting Extremal Graphs Having No Stable Cutsets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.00337","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:0c42376ef5599d34c6013128331c54465c8b713d833c29b854adbb8dd0dbc9a1","target":"record","created_at":"2026-07-05T09:42:39Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"b4e68cd0832a0f3c4d3e629b59f3e4071931b77120aa2d5d09a5937ceaa5016e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-11-30T03:29:06Z","title_canon_sha256":"dfa839db7feb6077b65fb8d3c906daaf5891f0bf325d1818bda038c03e7105f4"},"schema_version":"1.0","source":{"id":"2412.00337","kind":"arxiv","version":1}},"canonical_sha256":"b9b2c743df23151e736102f0557fb792794c25b3835698b57b5f715e46f0bb94","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b9b2c743df23151e736102f0557fb792794c25b3835698b57b5f715e46f0bb94","first_computed_at":"2026-07-05T09:42:39.802265Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:42:39.802265Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wwVqrvkufhw40F/MDyu7xRFuHA0KCNaxFOeu9ENZXC1Bmdph54l30O3k/WjZRhfI0fCkE0KemLBMU5EAPbQUDw==","signature_status":"signed_v1","signed_at":"2026-07-05T09:42:39.802760Z","signed_message":"canonical_sha256_bytes"},"source_id":"2412.00337","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0c42376ef5599d34c6013128331c54465c8b713d833c29b854adbb8dd0dbc9a1","sha256:9b356daa017569e25b0ef90481fbe5d928dcc13028465a2c3f97068a7638e70f"],"state_sha256":"e200bd73decffc7eea3d67b7b0cefef0d3a9408d5d6ed834223690d7068aaaee"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TmOkmt3hIH6CWLr2BQpNEzD7ghafBXQxRCMvrZ5uSlJGFaNNWYjOjURdE3XD2Y1LY3VBcWYlanqVIfWKdC4rBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T13:52:21.239191Z","bundle_sha256":"a7e27cbbb393330b1f51fa24cb85af95d0676d14e517a1ee912e5fe2ea2dda17"}}