{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:LFFZJGXPWJPFAUCVIR3LOBPDHG","short_pith_number":"pith:LFFZJGXP","schema_version":"1.0","canonical_sha256":"594b949aefb25e5050554476b705e3399d268dd4515a28064b629b0306890d00","source":{"kind":"arxiv","id":"1910.03363","version":1},"attestation_state":"computed","paper":{"title":"Exact and heuristic algorithms for the weighted total domination problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Eduardo \\'Alvarez-Miranda, Markus Sinnl","submitted_at":"2019-10-08T12:33:36Z","abstract_excerpt":"Dominating set problems are among the most important class of combinatorial problems in graph optimization, from a theoretical as well as from a practical point of view. In this paper, we address the recently introduced (minimum) weighted total domination problem. In this problem, we are given an undirected graph with a vertex weight function and an edge weight function. The goal is to find a total dominating set D in this graph with minimal weight. A total dominating set D is a subset of the vertices such that every vertex in the graph, including vertices in D, is adjacent to a vertex in D. T"},"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":"1910.03363","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-10-08T12:33:36Z","cross_cats_sorted":[],"title_canon_sha256":"d4d5e9ffc85c8b89dbd631aefd6708d3a1e8f5d47d2ec9b041aff5480309eed8","abstract_canon_sha256":"64dee0cb9c7540c7381536f6ae63273b8ade928a30a38b138eae2fa53484ea2e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:10:20.471083Z","signature_b64":"BaLr/IYtxYMEhre2PVPDdK9qnObfFewwCy0yluEgnqsv5rb0a4EF43Pjnv03QJ5ZEwXDGyQdoZ41JRXGEDSUAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"594b949aefb25e5050554476b705e3399d268dd4515a28064b629b0306890d00","last_reissued_at":"2026-07-05T00:10:20.470718Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:10:20.470718Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exact and heuristic algorithms for the weighted total domination problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Eduardo \\'Alvarez-Miranda, Markus Sinnl","submitted_at":"2019-10-08T12:33:36Z","abstract_excerpt":"Dominating set problems are among the most important class of combinatorial problems in graph optimization, from a theoretical as well as from a practical point of view. In this paper, we address the recently introduced (minimum) weighted total domination problem. In this problem, we are given an undirected graph with a vertex weight function and an edge weight function. The goal is to find a total dominating set D in this graph with minimal weight. A total dominating set D is a subset of the vertices such that every vertex in the graph, including vertices in D, is adjacent to a vertex in D. T"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1910.03363","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/1910.03363/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":"1910.03363","created_at":"2026-07-05T00:10:20.470780+00:00"},{"alias_kind":"arxiv_version","alias_value":"1910.03363v1","created_at":"2026-07-05T00:10:20.470780+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.03363","created_at":"2026-07-05T00:10:20.470780+00:00"},{"alias_kind":"pith_short_12","alias_value":"LFFZJGXPWJPF","created_at":"2026-07-05T00:10:20.470780+00:00"},{"alias_kind":"pith_short_16","alias_value":"LFFZJGXPWJPFAUCV","created_at":"2026-07-05T00:10:20.470780+00:00"},{"alias_kind":"pith_short_8","alias_value":"LFFZJGXP","created_at":"2026-07-05T00:10:20.470780+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/LFFZJGXPWJPFAUCVIR3LOBPDHG","json":"https://pith.science/pith/LFFZJGXPWJPFAUCVIR3LOBPDHG.json","graph_json":"https://pith.science/api/pith-number/LFFZJGXPWJPFAUCVIR3LOBPDHG/graph.json","events_json":"https://pith.science/api/pith-number/LFFZJGXPWJPFAUCVIR3LOBPDHG/events.json","paper":"https://pith.science/paper/LFFZJGXP"},"agent_actions":{"view_html":"https://pith.science/pith/LFFZJGXPWJPFAUCVIR3LOBPDHG","download_json":"https://pith.science/pith/LFFZJGXPWJPFAUCVIR3LOBPDHG.json","view_paper":"https://pith.science/paper/LFFZJGXP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1910.03363&json=true","fetch_graph":"https://pith.science/api/pith-number/LFFZJGXPWJPFAUCVIR3LOBPDHG/graph.json","fetch_events":"https://pith.science/api/pith-number/LFFZJGXPWJPFAUCVIR3LOBPDHG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LFFZJGXPWJPFAUCVIR3LOBPDHG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LFFZJGXPWJPFAUCVIR3LOBPDHG/action/storage_attestation","attest_author":"https://pith.science/pith/LFFZJGXPWJPFAUCVIR3LOBPDHG/action/author_attestation","sign_citation":"https://pith.science/pith/LFFZJGXPWJPFAUCVIR3LOBPDHG/action/citation_signature","submit_replication":"https://pith.science/pith/LFFZJGXPWJPFAUCVIR3LOBPDHG/action/replication_record"}},"created_at":"2026-07-05T00:10:20.470780+00:00","updated_at":"2026-07-05T00:10:20.470780+00:00"}