{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:UZA7M36AOB6GBEVCR42DL37JCV","short_pith_number":"pith:UZA7M36A","schema_version":"1.0","canonical_sha256":"a641f66fc0707c6092a28f3435efe915746df6b82f586ad8f0c65a8ba3249e03","source":{"kind":"arxiv","id":"1603.00254","version":1},"attestation_state":"computed","paper":{"title":"On the hardness of switching to a small number of edges","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.CC","authors_text":"Eva Jel\\'inkov\\'a, Jan Kratochv\\'il, V\\'it Jel\\'inek","submitted_at":"2016-03-01T12:59:49Z","abstract_excerpt":"Seidel's switching is a graph operation which makes a given vertex adjacent to precisely those vertices to which it was non-adjacent before, while keeping the rest of the graph unchanged. Two graphs are called switching-equivalent if one can be made isomorphic to the other one by a sequence of switches.\n  Jel\\'inkov\\'a et al. [DMTCS 13, no. 2, 2011] presented a proof that it is NP-complete to decide if the input graph can be switched to contain at most a given number of edges. There turns out to be a flaw in their proof. We present a correct proof.\n  Furthermore, we prove that the problem rema"},"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":"1603.00254","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-03-01T12:59:49Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"50a38be756ad89898f5267ae6b2f2715a1364720dedb3f7a45fa9283ed1d080f","abstract_canon_sha256":"39842d7cb5868934aa6ff616a9ad396f1e6ad6eaf4cf311304d4d0d10fc0ddc3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:45.498623Z","signature_b64":"4+WRdJBEDdVt8Cq4ypMXf7Y0+eCyQp3OsPtlkpvVTiedbiBZRw2KMhQhcH35nPeVllCLFyKM9L6ATVpiUTH5BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a641f66fc0707c6092a28f3435efe915746df6b82f586ad8f0c65a8ba3249e03","last_reissued_at":"2026-05-18T01:19:45.498101Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:45.498101Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the hardness of switching to a small number of edges","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.CC","authors_text":"Eva Jel\\'inkov\\'a, Jan Kratochv\\'il, V\\'it Jel\\'inek","submitted_at":"2016-03-01T12:59:49Z","abstract_excerpt":"Seidel's switching is a graph operation which makes a given vertex adjacent to precisely those vertices to which it was non-adjacent before, while keeping the rest of the graph unchanged. Two graphs are called switching-equivalent if one can be made isomorphic to the other one by a sequence of switches.\n  Jel\\'inkov\\'a et al. [DMTCS 13, no. 2, 2011] presented a proof that it is NP-complete to decide if the input graph can be switched to contain at most a given number of edges. There turns out to be a flaw in their proof. We present a correct proof.\n  Furthermore, we prove that the problem rema"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.00254","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":"1603.00254","created_at":"2026-05-18T01:19:45.498198+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.00254v1","created_at":"2026-05-18T01:19:45.498198+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.00254","created_at":"2026-05-18T01:19:45.498198+00:00"},{"alias_kind":"pith_short_12","alias_value":"UZA7M36AOB6G","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_16","alias_value":"UZA7M36AOB6GBEVC","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_8","alias_value":"UZA7M36A","created_at":"2026-05-18T12:30:46.583412+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/UZA7M36AOB6GBEVCR42DL37JCV","json":"https://pith.science/pith/UZA7M36AOB6GBEVCR42DL37JCV.json","graph_json":"https://pith.science/api/pith-number/UZA7M36AOB6GBEVCR42DL37JCV/graph.json","events_json":"https://pith.science/api/pith-number/UZA7M36AOB6GBEVCR42DL37JCV/events.json","paper":"https://pith.science/paper/UZA7M36A"},"agent_actions":{"view_html":"https://pith.science/pith/UZA7M36AOB6GBEVCR42DL37JCV","download_json":"https://pith.science/pith/UZA7M36AOB6GBEVCR42DL37JCV.json","view_paper":"https://pith.science/paper/UZA7M36A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.00254&json=true","fetch_graph":"https://pith.science/api/pith-number/UZA7M36AOB6GBEVCR42DL37JCV/graph.json","fetch_events":"https://pith.science/api/pith-number/UZA7M36AOB6GBEVCR42DL37JCV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UZA7M36AOB6GBEVCR42DL37JCV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UZA7M36AOB6GBEVCR42DL37JCV/action/storage_attestation","attest_author":"https://pith.science/pith/UZA7M36AOB6GBEVCR42DL37JCV/action/author_attestation","sign_citation":"https://pith.science/pith/UZA7M36AOB6GBEVCR42DL37JCV/action/citation_signature","submit_replication":"https://pith.science/pith/UZA7M36AOB6GBEVCR42DL37JCV/action/replication_record"}},"created_at":"2026-05-18T01:19:45.498198+00:00","updated_at":"2026-05-18T01:19:45.498198+00:00"}