{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:ZWCDZXGTHN3RVBSPIHAIGSHHY3","short_pith_number":"pith:ZWCDZXGT","canonical_record":{"source":{"id":"1709.01245","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-05T06:03:30Z","cross_cats_sorted":[],"title_canon_sha256":"b66c80b7e847e17fb8f6d02eb30f3f6243a164a30cd2eaf65a05416525de3705","abstract_canon_sha256":"c9f162d041a2b403c59c5b402421dadc6fc24b1e7496cb90d07f7caa0c6b259a"},"schema_version":"1.0"},"canonical_sha256":"cd843cdcd33b771a864f41c08348e7c6ffdb8e2ecdb8c044320d85908e8459f3","source":{"kind":"arxiv","id":"1709.01245","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.01245","created_at":"2026-05-18T00:25:28Z"},{"alias_kind":"arxiv_version","alias_value":"1709.01245v2","created_at":"2026-05-18T00:25:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.01245","created_at":"2026-05-18T00:25:28Z"},{"alias_kind":"pith_short_12","alias_value":"ZWCDZXGTHN3R","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZWCDZXGTHN3RVBSP","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZWCDZXGT","created_at":"2026-05-18T12:31:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:ZWCDZXGTHN3RVBSPIHAIGSHHY3","target":"record","payload":{"canonical_record":{"source":{"id":"1709.01245","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-05T06:03:30Z","cross_cats_sorted":[],"title_canon_sha256":"b66c80b7e847e17fb8f6d02eb30f3f6243a164a30cd2eaf65a05416525de3705","abstract_canon_sha256":"c9f162d041a2b403c59c5b402421dadc6fc24b1e7496cb90d07f7caa0c6b259a"},"schema_version":"1.0"},"canonical_sha256":"cd843cdcd33b771a864f41c08348e7c6ffdb8e2ecdb8c044320d85908e8459f3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:28.865258Z","signature_b64":"p9KNjK5dZnLxzL3gyl2+nO+qBjhXzrdIceviQPgA6ymyOWjrOb3a96TiBTVBKQZitiRVDiPZQpSWRNpOZeulAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cd843cdcd33b771a864f41c08348e7c6ffdb8e2ecdb8c044320d85908e8459f3","last_reissued_at":"2026-05-18T00:25:28.864680Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:28.864680Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.01245","source_version":2,"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-05-18T00:25:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GiX5ExIwmAga1n4Cs7oFuR0CLgw/MSQ+RKXJ/rgtd47KzVAC80kKzDBxm2sLTKeXykh9FIe89OXm7JXdOkllCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T22:18:01.370828Z"},"content_sha256":"390ae278abcf1c284d7c84dc7573c434fc2dddc827b73213451bc821ebbe1c3c","schema_version":"1.0","event_id":"sha256:390ae278abcf1c284d7c84dc7573c434fc2dddc827b73213451bc821ebbe1c3c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:ZWCDZXGTHN3RVBSPIHAIGSHHY3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On $k$-tuple and $k$-tuple total domination numbers of regular graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Amir Jafari, Morteza Saghafian, Sharareh Alipour","submitted_at":"2017-09-05T06:03:30Z","abstract_excerpt":"Let $G$ be a connected graph of order $n$, whose minimum vertex degree is at least $k$. A subset $S$ of vertices in $G$ is a $k$-tuple total dominating set if every vertex of $G$ is adjacent to at least $k$ vertices in $S$. The minimum cardinality of a $k$-tuple total dominating set of $G$ is the $k$-tuple total domination number of $G$, denoted by $\\gamma_{\\times k,t}(G)$. Henning and Yeo in \\cite{hen} proved that if $G$ is a cubic graph different from the Heawood graph, $\\gamma_{\\times 2, t}(G) \\leq \\frac{5}{6}n$, and this bound is sharp. Similarly, a $k$-tuple dominating set is a subset $S$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.01245","kind":"arxiv","version":2},"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"},"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-05-18T00:25:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BduIqG0xKDY3zuDFA0RmN6/O03yIBpUSToibWYzDtQTSSsi/OKWVt3LEjzzl0aDqmM5vuLyyKK2tChufjE6qAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T22:18:01.371483Z"},"content_sha256":"158c2e0cbad06e1191f4ee6002b167e94166a64280feb32440006affd76eaf38","schema_version":"1.0","event_id":"sha256:158c2e0cbad06e1191f4ee6002b167e94166a64280feb32440006affd76eaf38"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZWCDZXGTHN3RVBSPIHAIGSHHY3/bundle.json","state_url":"https://pith.science/pith/ZWCDZXGTHN3RVBSPIHAIGSHHY3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZWCDZXGTHN3RVBSPIHAIGSHHY3/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-06-04T22:18:01Z","links":{"resolver":"https://pith.science/pith/ZWCDZXGTHN3RVBSPIHAIGSHHY3","bundle":"https://pith.science/pith/ZWCDZXGTHN3RVBSPIHAIGSHHY3/bundle.json","state":"https://pith.science/pith/ZWCDZXGTHN3RVBSPIHAIGSHHY3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZWCDZXGTHN3RVBSPIHAIGSHHY3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:ZWCDZXGTHN3RVBSPIHAIGSHHY3","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":"c9f162d041a2b403c59c5b402421dadc6fc24b1e7496cb90d07f7caa0c6b259a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-05T06:03:30Z","title_canon_sha256":"b66c80b7e847e17fb8f6d02eb30f3f6243a164a30cd2eaf65a05416525de3705"},"schema_version":"1.0","source":{"id":"1709.01245","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.01245","created_at":"2026-05-18T00:25:28Z"},{"alias_kind":"arxiv_version","alias_value":"1709.01245v2","created_at":"2026-05-18T00:25:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.01245","created_at":"2026-05-18T00:25:28Z"},{"alias_kind":"pith_short_12","alias_value":"ZWCDZXGTHN3R","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZWCDZXGTHN3RVBSP","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZWCDZXGT","created_at":"2026-05-18T12:31:59Z"}],"graph_snapshots":[{"event_id":"sha256:158c2e0cbad06e1191f4ee6002b167e94166a64280feb32440006affd76eaf38","target":"graph","created_at":"2026-05-18T00:25:28Z","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"},"paper":{"abstract_excerpt":"Let $G$ be a connected graph of order $n$, whose minimum vertex degree is at least $k$. A subset $S$ of vertices in $G$ is a $k$-tuple total dominating set if every vertex of $G$ is adjacent to at least $k$ vertices in $S$. The minimum cardinality of a $k$-tuple total dominating set of $G$ is the $k$-tuple total domination number of $G$, denoted by $\\gamma_{\\times k,t}(G)$. Henning and Yeo in \\cite{hen} proved that if $G$ is a cubic graph different from the Heawood graph, $\\gamma_{\\times 2, t}(G) \\leq \\frac{5}{6}n$, and this bound is sharp. Similarly, a $k$-tuple dominating set is a subset $S$","authors_text":"Amir Jafari, Morteza Saghafian, Sharareh Alipour","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-05T06:03:30Z","title":"On $k$-tuple and $k$-tuple total domination numbers of regular graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.01245","kind":"arxiv","version":2},"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:390ae278abcf1c284d7c84dc7573c434fc2dddc827b73213451bc821ebbe1c3c","target":"record","created_at":"2026-05-18T00:25:28Z","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":"c9f162d041a2b403c59c5b402421dadc6fc24b1e7496cb90d07f7caa0c6b259a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-05T06:03:30Z","title_canon_sha256":"b66c80b7e847e17fb8f6d02eb30f3f6243a164a30cd2eaf65a05416525de3705"},"schema_version":"1.0","source":{"id":"1709.01245","kind":"arxiv","version":2}},"canonical_sha256":"cd843cdcd33b771a864f41c08348e7c6ffdb8e2ecdb8c044320d85908e8459f3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cd843cdcd33b771a864f41c08348e7c6ffdb8e2ecdb8c044320d85908e8459f3","first_computed_at":"2026-05-18T00:25:28.864680Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:25:28.864680Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"p9KNjK5dZnLxzL3gyl2+nO+qBjhXzrdIceviQPgA6ymyOWjrOb3a96TiBTVBKQZitiRVDiPZQpSWRNpOZeulAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:25:28.865258Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.01245","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:390ae278abcf1c284d7c84dc7573c434fc2dddc827b73213451bc821ebbe1c3c","sha256:158c2e0cbad06e1191f4ee6002b167e94166a64280feb32440006affd76eaf38"],"state_sha256":"c50745df48745d5c17ef947898c2d35db52a07b2773fae35cd6ba3fbc07ca4bd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SfNs9B0r/YsASECgrR9BCI8mJaFMhp5hElNRvOj1tJwZOXtdm5lKSMqrWMGmljU/blzyUeNZOqK/GfVfRjvvAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T22:18:01.375093Z","bundle_sha256":"fa1914a8d06747f939a8d0c213417be3d79760379b5d1bddb6b0e7f5f09aab3c"}}