{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:LFFZJGXPWJPFAUCVIR3LOBPDHG","short_pith_number":"pith:LFFZJGXP","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"},"canonical_sha256":"594b949aefb25e5050554476b705e3399d268dd4515a28064b629b0306890d00","source":{"kind":"arxiv","id":"1910.03363","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1910.03363","created_at":"2026-07-05T00:10:20Z"},{"alias_kind":"arxiv_version","alias_value":"1910.03363v1","created_at":"2026-07-05T00:10:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.03363","created_at":"2026-07-05T00:10:20Z"},{"alias_kind":"pith_short_12","alias_value":"LFFZJGXPWJPF","created_at":"2026-07-05T00:10:20Z"},{"alias_kind":"pith_short_16","alias_value":"LFFZJGXPWJPFAUCV","created_at":"2026-07-05T00:10:20Z"},{"alias_kind":"pith_short_8","alias_value":"LFFZJGXP","created_at":"2026-07-05T00:10:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:LFFZJGXPWJPFAUCVIR3LOBPDHG","target":"record","payload":{"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"},"canonical_sha256":"594b949aefb25e5050554476b705e3399d268dd4515a28064b629b0306890d00","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"},"source_kind":"arxiv","source_id":"1910.03363","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T00:10:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Gkvr0KyVmOz5c734Y7iLiwYej6mqabSnpBIYkiYqQZAe6sjIyiELFYUoQxITs8PHH6WxqM7hsKhh8n5+fnuvAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T05:36:43.162457Z"},"content_sha256":"0d1f708ae75c6a681528caadbfc9b2ef7eae23b95f8e918d137ff44006822f31","schema_version":"1.0","event_id":"sha256:0d1f708ae75c6a681528caadbfc9b2ef7eae23b95f8e918d137ff44006822f31"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:LFFZJGXPWJPFAUCVIR3LOBPDHG","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T00:10:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xtF9U9pVitRtUSdMITMlEJV4EgLj+HcLJ5JXyR7r91oEalySyF0yF2bRdxbH6se8sBLLT3iNYvNxDAeLUU6iBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T05:36:43.162965Z"},"content_sha256":"b797be4b1234c2180dfb47e80fe67df0acea234636ae3f96f65d1ea977ded262","schema_version":"1.0","event_id":"sha256:b797be4b1234c2180dfb47e80fe67df0acea234636ae3f96f65d1ea977ded262"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LFFZJGXPWJPFAUCVIR3LOBPDHG/bundle.json","state_url":"https://pith.science/pith/LFFZJGXPWJPFAUCVIR3LOBPDHG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LFFZJGXPWJPFAUCVIR3LOBPDHG/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-21T05:36:43Z","links":{"resolver":"https://pith.science/pith/LFFZJGXPWJPFAUCVIR3LOBPDHG","bundle":"https://pith.science/pith/LFFZJGXPWJPFAUCVIR3LOBPDHG/bundle.json","state":"https://pith.science/pith/LFFZJGXPWJPFAUCVIR3LOBPDHG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LFFZJGXPWJPFAUCVIR3LOBPDHG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:LFFZJGXPWJPFAUCVIR3LOBPDHG","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"64dee0cb9c7540c7381536f6ae63273b8ade928a30a38b138eae2fa53484ea2e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-10-08T12:33:36Z","title_canon_sha256":"d4d5e9ffc85c8b89dbd631aefd6708d3a1e8f5d47d2ec9b041aff5480309eed8"},"schema_version":"1.0","source":{"id":"1910.03363","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1910.03363","created_at":"2026-07-05T00:10:20Z"},{"alias_kind":"arxiv_version","alias_value":"1910.03363v1","created_at":"2026-07-05T00:10:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.03363","created_at":"2026-07-05T00:10:20Z"},{"alias_kind":"pith_short_12","alias_value":"LFFZJGXPWJPF","created_at":"2026-07-05T00:10:20Z"},{"alias_kind":"pith_short_16","alias_value":"LFFZJGXPWJPFAUCV","created_at":"2026-07-05T00:10:20Z"},{"alias_kind":"pith_short_8","alias_value":"LFFZJGXP","created_at":"2026-07-05T00:10:20Z"}],"graph_snapshots":[{"event_id":"sha256:b797be4b1234c2180dfb47e80fe67df0acea234636ae3f96f65d1ea977ded262","target":"graph","created_at":"2026-07-05T00:10:20Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1910.03363/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Eduardo \\'Alvarez-Miranda, Markus Sinnl","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-10-08T12:33:36Z","title":"Exact and heuristic algorithms for the weighted total domination problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1910.03363","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:0d1f708ae75c6a681528caadbfc9b2ef7eae23b95f8e918d137ff44006822f31","target":"record","created_at":"2026-07-05T00:10:20Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"64dee0cb9c7540c7381536f6ae63273b8ade928a30a38b138eae2fa53484ea2e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-10-08T12:33:36Z","title_canon_sha256":"d4d5e9ffc85c8b89dbd631aefd6708d3a1e8f5d47d2ec9b041aff5480309eed8"},"schema_version":"1.0","source":{"id":"1910.03363","kind":"arxiv","version":1}},"canonical_sha256":"594b949aefb25e5050554476b705e3399d268dd4515a28064b629b0306890d00","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"594b949aefb25e5050554476b705e3399d268dd4515a28064b629b0306890d00","first_computed_at":"2026-07-05T00:10:20.470718Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:10:20.470718Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BaLr/IYtxYMEhre2PVPDdK9qnObfFewwCy0yluEgnqsv5rb0a4EF43Pjnv03QJ5ZEwXDGyQdoZ41JRXGEDSUAg==","signature_status":"signed_v1","signed_at":"2026-07-05T00:10:20.471083Z","signed_message":"canonical_sha256_bytes"},"source_id":"1910.03363","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0d1f708ae75c6a681528caadbfc9b2ef7eae23b95f8e918d137ff44006822f31","sha256:b797be4b1234c2180dfb47e80fe67df0acea234636ae3f96f65d1ea977ded262"],"state_sha256":"2f067e6c1311b9c884d3a0710e867c470cac777604584a9add771b842fbcff83"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7T1D5JiSGbsM+wGdIQUqdhfsiyq+pAisGUmWNWdkuWVtiS/K+BDnNcK8cS/vE5yDjDQBFnydWnmjXN/CWQhiDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-21T05:36:43.166576Z","bundle_sha256":"7d0bfd44602739a2d19f6b4abf0d4a6bea17159e600e7ead41a056327c051b50"}}