{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:AA7OBDRXQ4RDI6UXMKIPRCZTSK","short_pith_number":"pith:AA7OBDRX","schema_version":"1.0","canonical_sha256":"003ee08e378722347a976290f88b33928cdcab33e3f8381d255ab6d97d24f352","source":{"kind":"arxiv","id":"1307.6663","version":4},"attestation_state":"computed","paper":{"title":"On Complexities of Minus Domination","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Hsiang-Hsuan Liu, Lu\\'erbio Faria, Tao-Ming Wang, Ton Kloks, Wing-Kai Hon, Yue-Li Wang","submitted_at":"2013-07-25T08:35:39Z","abstract_excerpt":"A function f: V \\rightarrow \\{-1,0,1\\} is a minus-domination function of a graph G=(V,E) if the values over the vertices in each closed neighborhood sum to a positive number. The weight of f is the sum of f(x) over all vertices x \\in V. The minus-domination number \\gamma^{-}(G) is the minimum weight over all minus-domination functions. The size of a minus domination is the number of vertices that are assigned 1. In this paper we show that the minus-domination problem is fixed-parameter tractable for d-degenerate graphs when parameterized by the size of the minus-dominating set and by d. The mi"},"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":"1307.6663","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-07-25T08:35:39Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"9f4a82ac5974c8b5ae3444b076aa10d11bda59ce979e118b0974dbe08dd4fb86","abstract_canon_sha256":"a1a4121e31d62e70680cd08379f06613b9ba9343a96d2496d695436a6c2e02fd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:15:17.868751Z","signature_b64":"gyzwEe/uPC4Ko4BiIh2834csh7HOMue8kAB5847r+3TVbtBtif/roIs54CubFOI46vC4PuwnhEtoOk7iPjIgCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"003ee08e378722347a976290f88b33928cdcab33e3f8381d255ab6d97d24f352","last_reissued_at":"2026-05-18T03:15:17.867665Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:15:17.867665Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Complexities of Minus Domination","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Hsiang-Hsuan Liu, Lu\\'erbio Faria, Tao-Ming Wang, Ton Kloks, Wing-Kai Hon, Yue-Li Wang","submitted_at":"2013-07-25T08:35:39Z","abstract_excerpt":"A function f: V \\rightarrow \\{-1,0,1\\} is a minus-domination function of a graph G=(V,E) if the values over the vertices in each closed neighborhood sum to a positive number. The weight of f is the sum of f(x) over all vertices x \\in V. The minus-domination number \\gamma^{-}(G) is the minimum weight over all minus-domination functions. The size of a minus domination is the number of vertices that are assigned 1. In this paper we show that the minus-domination problem is fixed-parameter tractable for d-degenerate graphs when parameterized by the size of the minus-dominating set and by d. The mi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.6663","kind":"arxiv","version":4},"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":"1307.6663","created_at":"2026-05-18T03:15:17.867866+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.6663v4","created_at":"2026-05-18T03:15:17.867866+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.6663","created_at":"2026-05-18T03:15:17.867866+00:00"},{"alias_kind":"pith_short_12","alias_value":"AA7OBDRXQ4RD","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_16","alias_value":"AA7OBDRXQ4RDI6UX","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_8","alias_value":"AA7OBDRX","created_at":"2026-05-18T12:27:38.830355+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/AA7OBDRXQ4RDI6UXMKIPRCZTSK","json":"https://pith.science/pith/AA7OBDRXQ4RDI6UXMKIPRCZTSK.json","graph_json":"https://pith.science/api/pith-number/AA7OBDRXQ4RDI6UXMKIPRCZTSK/graph.json","events_json":"https://pith.science/api/pith-number/AA7OBDRXQ4RDI6UXMKIPRCZTSK/events.json","paper":"https://pith.science/paper/AA7OBDRX"},"agent_actions":{"view_html":"https://pith.science/pith/AA7OBDRXQ4RDI6UXMKIPRCZTSK","download_json":"https://pith.science/pith/AA7OBDRXQ4RDI6UXMKIPRCZTSK.json","view_paper":"https://pith.science/paper/AA7OBDRX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.6663&json=true","fetch_graph":"https://pith.science/api/pith-number/AA7OBDRXQ4RDI6UXMKIPRCZTSK/graph.json","fetch_events":"https://pith.science/api/pith-number/AA7OBDRXQ4RDI6UXMKIPRCZTSK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AA7OBDRXQ4RDI6UXMKIPRCZTSK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AA7OBDRXQ4RDI6UXMKIPRCZTSK/action/storage_attestation","attest_author":"https://pith.science/pith/AA7OBDRXQ4RDI6UXMKIPRCZTSK/action/author_attestation","sign_citation":"https://pith.science/pith/AA7OBDRXQ4RDI6UXMKIPRCZTSK/action/citation_signature","submit_replication":"https://pith.science/pith/AA7OBDRXQ4RDI6UXMKIPRCZTSK/action/replication_record"}},"created_at":"2026-05-18T03:15:17.867866+00:00","updated_at":"2026-05-18T03:15:17.867866+00:00"}