{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:3O2FH3SOS2PXNNCRWHYCJH2WYD","short_pith_number":"pith:3O2FH3SO","schema_version":"1.0","canonical_sha256":"dbb453ee4e969f76b451b1f0249f56c0f2a73b2f17b5b186a14b3320137750a8","source":{"kind":"arxiv","id":"1903.01800","version":1},"attestation_state":"computed","paper":{"title":"Reducing the domination number of graphs via edge contractions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.CC","authors_text":"Bernard Ries, Esther Galby, Paloma T. Lima","submitted_at":"2019-03-05T12:57:39Z","abstract_excerpt":"In this paper, we study the following problem: given a connected graph $G$, can we reduce the domination number of $G$ by at least one using $k$ edge contractions, for some fixed integer $k \\geq 0$? We present positive and negative results regarding the computational complexity of this problem."},"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":"1903.01800","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-03-05T12:57:39Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"c1e56c6c6039b5eb10339fbbc0b2fce849917a53cbbc51d2d6e18561c313b86d","abstract_canon_sha256":"798f902ee3521bf55a1306b2b872422ed6203b8e8aa49271a564df8006c2a834"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:59.715783Z","signature_b64":"jlof4/93Kur1xTGWvYKLqxV7fsxgYFI0o+pUvxivL3v+Swn+5J94+CnNbbS8H4gcRo5pSLHPcl2H4Rzt4zSoCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dbb453ee4e969f76b451b1f0249f56c0f2a73b2f17b5b186a14b3320137750a8","last_reissued_at":"2026-05-17T23:51:59.715213Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:59.715213Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reducing the domination number of graphs via edge contractions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.CC","authors_text":"Bernard Ries, Esther Galby, Paloma T. Lima","submitted_at":"2019-03-05T12:57:39Z","abstract_excerpt":"In this paper, we study the following problem: given a connected graph $G$, can we reduce the domination number of $G$ by at least one using $k$ edge contractions, for some fixed integer $k \\geq 0$? We present positive and negative results regarding the computational complexity of this problem."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.01800","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":"1903.01800","created_at":"2026-05-17T23:51:59.715304+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.01800v1","created_at":"2026-05-17T23:51:59.715304+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.01800","created_at":"2026-05-17T23:51:59.715304+00:00"},{"alias_kind":"pith_short_12","alias_value":"3O2FH3SOS2PX","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_16","alias_value":"3O2FH3SOS2PXNNCR","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_8","alias_value":"3O2FH3SO","created_at":"2026-05-18T12:33:07.085635+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/3O2FH3SOS2PXNNCRWHYCJH2WYD","json":"https://pith.science/pith/3O2FH3SOS2PXNNCRWHYCJH2WYD.json","graph_json":"https://pith.science/api/pith-number/3O2FH3SOS2PXNNCRWHYCJH2WYD/graph.json","events_json":"https://pith.science/api/pith-number/3O2FH3SOS2PXNNCRWHYCJH2WYD/events.json","paper":"https://pith.science/paper/3O2FH3SO"},"agent_actions":{"view_html":"https://pith.science/pith/3O2FH3SOS2PXNNCRWHYCJH2WYD","download_json":"https://pith.science/pith/3O2FH3SOS2PXNNCRWHYCJH2WYD.json","view_paper":"https://pith.science/paper/3O2FH3SO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.01800&json=true","fetch_graph":"https://pith.science/api/pith-number/3O2FH3SOS2PXNNCRWHYCJH2WYD/graph.json","fetch_events":"https://pith.science/api/pith-number/3O2FH3SOS2PXNNCRWHYCJH2WYD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3O2FH3SOS2PXNNCRWHYCJH2WYD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3O2FH3SOS2PXNNCRWHYCJH2WYD/action/storage_attestation","attest_author":"https://pith.science/pith/3O2FH3SOS2PXNNCRWHYCJH2WYD/action/author_attestation","sign_citation":"https://pith.science/pith/3O2FH3SOS2PXNNCRWHYCJH2WYD/action/citation_signature","submit_replication":"https://pith.science/pith/3O2FH3SOS2PXNNCRWHYCJH2WYD/action/replication_record"}},"created_at":"2026-05-17T23:51:59.715304+00:00","updated_at":"2026-05-17T23:51:59.715304+00:00"}