{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:YKNIBLRJUDEQ3FBL3N72G5XHVO","short_pith_number":"pith:YKNIBLRJ","schema_version":"1.0","canonical_sha256":"c29a80ae29a0c90d942bdb7fa376e7ab944d32af0d62f533af96f5f1ef953523","source":{"kind":"arxiv","id":"2606.00802","version":1},"attestation_state":"computed","paper":{"title":"Characterizing all nonbipartite well-edge-dominated graphs","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Kirsti Kuenzel, Sarah E. Anderson","submitted_at":"2026-05-30T16:40:50Z","abstract_excerpt":"Given a graph $G$, a set $F$ of edges is an edge dominating set of $G$ if every edge in $G$ is either in $F$ or adjacent to an edge in $F$. A graph $G$ is said to be well-edge-dominated if every minimal edge dominating set has the same cardinality. This definition is the edge version of domination in that a set $D\\subseteq V(G)$ is a dominating set if every vertex in $G$ is in $D$ or adjacent to a vertex in $D$ and the domination number $\\gamma(G)$ is the minimum cardinality among all dominating sets. In this paper, we complete the characterization of all nonbipartite, well-edge-dominated grap"},"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":"2606.00802","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-30T16:40:50Z","cross_cats_sorted":[],"title_canon_sha256":"d5c263bd51869842e6b1fe9b2c60e45021927ffc8a390e0953986db69836e22d","abstract_canon_sha256":"d1562e7aa09bf3e48ce560e2ceb63c9490e860b5b2e311f994824057b2ad8814"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-02T01:04:06.192299Z","signature_b64":"X2SuEaVTE6QllPCvgEiIswlDcfDnUnFUW59I/QCeB17SGI2tsBmTT0Xet/1x1fRKVYr5ELadhRs+zjBGra7BDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c29a80ae29a0c90d942bdb7fa376e7ab944d32af0d62f533af96f5f1ef953523","last_reissued_at":"2026-06-02T01:04:06.191928Z","signature_status":"signed_v1","first_computed_at":"2026-06-02T01:04:06.191928Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Characterizing all nonbipartite well-edge-dominated graphs","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Kirsti Kuenzel, Sarah E. Anderson","submitted_at":"2026-05-30T16:40:50Z","abstract_excerpt":"Given a graph $G$, a set $F$ of edges is an edge dominating set of $G$ if every edge in $G$ is either in $F$ or adjacent to an edge in $F$. A graph $G$ is said to be well-edge-dominated if every minimal edge dominating set has the same cardinality. This definition is the edge version of domination in that a set $D\\subseteq V(G)$ is a dominating set if every vertex in $G$ is in $D$ or adjacent to a vertex in $D$ and the domination number $\\gamma(G)$ is the minimum cardinality among all dominating sets. In this paper, we complete the characterization of all nonbipartite, well-edge-dominated grap"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.00802","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/2606.00802/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":"2606.00802","created_at":"2026-06-02T01:04:06.191996+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.00802v1","created_at":"2026-06-02T01:04:06.191996+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.00802","created_at":"2026-06-02T01:04:06.191996+00:00"},{"alias_kind":"pith_short_12","alias_value":"YKNIBLRJUDEQ","created_at":"2026-06-02T01:04:06.191996+00:00"},{"alias_kind":"pith_short_16","alias_value":"YKNIBLRJUDEQ3FBL","created_at":"2026-06-02T01:04:06.191996+00:00"},{"alias_kind":"pith_short_8","alias_value":"YKNIBLRJ","created_at":"2026-06-02T01:04:06.191996+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/YKNIBLRJUDEQ3FBL3N72G5XHVO","json":"https://pith.science/pith/YKNIBLRJUDEQ3FBL3N72G5XHVO.json","graph_json":"https://pith.science/api/pith-number/YKNIBLRJUDEQ3FBL3N72G5XHVO/graph.json","events_json":"https://pith.science/api/pith-number/YKNIBLRJUDEQ3FBL3N72G5XHVO/events.json","paper":"https://pith.science/paper/YKNIBLRJ"},"agent_actions":{"view_html":"https://pith.science/pith/YKNIBLRJUDEQ3FBL3N72G5XHVO","download_json":"https://pith.science/pith/YKNIBLRJUDEQ3FBL3N72G5XHVO.json","view_paper":"https://pith.science/paper/YKNIBLRJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.00802&json=true","fetch_graph":"https://pith.science/api/pith-number/YKNIBLRJUDEQ3FBL3N72G5XHVO/graph.json","fetch_events":"https://pith.science/api/pith-number/YKNIBLRJUDEQ3FBL3N72G5XHVO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YKNIBLRJUDEQ3FBL3N72G5XHVO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YKNIBLRJUDEQ3FBL3N72G5XHVO/action/storage_attestation","attest_author":"https://pith.science/pith/YKNIBLRJUDEQ3FBL3N72G5XHVO/action/author_attestation","sign_citation":"https://pith.science/pith/YKNIBLRJUDEQ3FBL3N72G5XHVO/action/citation_signature","submit_replication":"https://pith.science/pith/YKNIBLRJUDEQ3FBL3N72G5XHVO/action/replication_record"}},"created_at":"2026-06-02T01:04:06.191996+00:00","updated_at":"2026-06-02T01:04:06.191996+00:00"}