{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:FOE4N6QM72DW42RKBHESO6MNFY","short_pith_number":"pith:FOE4N6QM","canonical_record":{"source":{"id":"1702.00646","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-02T12:38:03Z","cross_cats_sorted":[],"title_canon_sha256":"d273d2182a1cbd710fef7f41765ed33e643efe5498bbb2b0adb723d1a6b5be76","abstract_canon_sha256":"5062f6f025887b562aacd73e82412a4e0fa4a852f2dddac75867759f500c671e"},"schema_version":"1.0"},"canonical_sha256":"2b89c6fa0cfe876e6a2a09c927798d2e2b2351ee86f4ad849415ab8b9af6bd9c","source":{"kind":"arxiv","id":"1702.00646","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.00646","created_at":"2026-05-17T23:53:44Z"},{"alias_kind":"arxiv_version","alias_value":"1702.00646v3","created_at":"2026-05-17T23:53:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.00646","created_at":"2026-05-17T23:53:44Z"},{"alias_kind":"pith_short_12","alias_value":"FOE4N6QM72DW","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FOE4N6QM72DW42RK","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FOE4N6QM","created_at":"2026-05-18T12:31:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:FOE4N6QM72DW42RKBHESO6MNFY","target":"record","payload":{"canonical_record":{"source":{"id":"1702.00646","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-02T12:38:03Z","cross_cats_sorted":[],"title_canon_sha256":"d273d2182a1cbd710fef7f41765ed33e643efe5498bbb2b0adb723d1a6b5be76","abstract_canon_sha256":"5062f6f025887b562aacd73e82412a4e0fa4a852f2dddac75867759f500c671e"},"schema_version":"1.0"},"canonical_sha256":"2b89c6fa0cfe876e6a2a09c927798d2e2b2351ee86f4ad849415ab8b9af6bd9c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:44.562811Z","signature_b64":"s9aemh4p25H5mDWrwZmNgPzX3LoR7XvonbDQe+qTPzaP8I1rgEJqO6++Ehv62bhM6cKytarZLoCpSs0YU5w3BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2b89c6fa0cfe876e6a2a09c927798d2e2b2351ee86f4ad849415ab8b9af6bd9c","last_reissued_at":"2026-05-17T23:53:44.562416Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:44.562416Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.00646","source_version":3,"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-17T23:53:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hbM9tRoR8FAz5VDX7xNwD+3egBoot/kj5tVKxholqpnl1Entl6ecCyg1BWoQcyKP2hlF2lT1BfrtUQLtE8Q6Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T23:20:16.264292Z"},"content_sha256":"28e8d63bebd84149d6c37371aee7373c1b0d860e817bdd1c234ac965e7e56b71","schema_version":"1.0","event_id":"sha256:28e8d63bebd84149d6c37371aee7373c1b0d860e817bdd1c234ac965e7e56b71"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:FOE4N6QM72DW42RKBHESO6MNFY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Twin domination number of Tournaments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dorota Osula, Rita Zuazua","submitted_at":"2017-02-02T12:38:03Z","abstract_excerpt":"Let $D=(V,A)$ be a digraph. A subset $S$ of $V$ is called a twin dominating set of $D$ if for every vertex $v\\in V-S$, there exists vertices $u_1,u_2 \\in S$ such that $(v,u_1)$ and $(u_2,v)$ are arcs in $D$. The minimum cardinality of a twin dominating set in $D$ is called the twin domination number of $D$ and is denoted by $\\gamma ^{*}(D)$.\n  The upper orientable twin domination number of a graph $G$ is $DOM^{*}(G)=\\max\\{ \\gamma ^{*}(D)|D \\ \\text{is an orientation of G} \\}.$ It has been conjectured that for the complete graph $K_n$ with $n\\geq 8$, $DOM^{*}(K_n)=\\left\\lceil \\frac{n+1}{2}\\right"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.00646","kind":"arxiv","version":3},"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-17T23:53:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RXg+IhSpJX2e2tQW53lVHl9AjB6Ah8MZKO2HrZZqgkJYJOPQz7cy6U5Oc1wWSFO9CkdBhG1nPsiqxY7tvVSVBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T23:20:16.264936Z"},"content_sha256":"e20c56076d269cf2875910d6058b1f2655abb2bc34ddac5159f1a31bf8419fa3","schema_version":"1.0","event_id":"sha256:e20c56076d269cf2875910d6058b1f2655abb2bc34ddac5159f1a31bf8419fa3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FOE4N6QM72DW42RKBHESO6MNFY/bundle.json","state_url":"https://pith.science/pith/FOE4N6QM72DW42RKBHESO6MNFY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FOE4N6QM72DW42RKBHESO6MNFY/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-05-27T23:20:16Z","links":{"resolver":"https://pith.science/pith/FOE4N6QM72DW42RKBHESO6MNFY","bundle":"https://pith.science/pith/FOE4N6QM72DW42RKBHESO6MNFY/bundle.json","state":"https://pith.science/pith/FOE4N6QM72DW42RKBHESO6MNFY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FOE4N6QM72DW42RKBHESO6MNFY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:FOE4N6QM72DW42RKBHESO6MNFY","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":"5062f6f025887b562aacd73e82412a4e0fa4a852f2dddac75867759f500c671e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-02T12:38:03Z","title_canon_sha256":"d273d2182a1cbd710fef7f41765ed33e643efe5498bbb2b0adb723d1a6b5be76"},"schema_version":"1.0","source":{"id":"1702.00646","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.00646","created_at":"2026-05-17T23:53:44Z"},{"alias_kind":"arxiv_version","alias_value":"1702.00646v3","created_at":"2026-05-17T23:53:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.00646","created_at":"2026-05-17T23:53:44Z"},{"alias_kind":"pith_short_12","alias_value":"FOE4N6QM72DW","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FOE4N6QM72DW42RK","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FOE4N6QM","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:e20c56076d269cf2875910d6058b1f2655abb2bc34ddac5159f1a31bf8419fa3","target":"graph","created_at":"2026-05-17T23:53:44Z","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 $D=(V,A)$ be a digraph. A subset $S$ of $V$ is called a twin dominating set of $D$ if for every vertex $v\\in V-S$, there exists vertices $u_1,u_2 \\in S$ such that $(v,u_1)$ and $(u_2,v)$ are arcs in $D$. The minimum cardinality of a twin dominating set in $D$ is called the twin domination number of $D$ and is denoted by $\\gamma ^{*}(D)$.\n  The upper orientable twin domination number of a graph $G$ is $DOM^{*}(G)=\\max\\{ \\gamma ^{*}(D)|D \\ \\text{is an orientation of G} \\}.$ It has been conjectured that for the complete graph $K_n$ with $n\\geq 8$, $DOM^{*}(K_n)=\\left\\lceil \\frac{n+1}{2}\\right","authors_text":"Dorota Osula, Rita Zuazua","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-02T12:38:03Z","title":"Twin domination number of Tournaments"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.00646","kind":"arxiv","version":3},"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:28e8d63bebd84149d6c37371aee7373c1b0d860e817bdd1c234ac965e7e56b71","target":"record","created_at":"2026-05-17T23:53:44Z","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":"5062f6f025887b562aacd73e82412a4e0fa4a852f2dddac75867759f500c671e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-02T12:38:03Z","title_canon_sha256":"d273d2182a1cbd710fef7f41765ed33e643efe5498bbb2b0adb723d1a6b5be76"},"schema_version":"1.0","source":{"id":"1702.00646","kind":"arxiv","version":3}},"canonical_sha256":"2b89c6fa0cfe876e6a2a09c927798d2e2b2351ee86f4ad849415ab8b9af6bd9c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2b89c6fa0cfe876e6a2a09c927798d2e2b2351ee86f4ad849415ab8b9af6bd9c","first_computed_at":"2026-05-17T23:53:44.562416Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:53:44.562416Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"s9aemh4p25H5mDWrwZmNgPzX3LoR7XvonbDQe+qTPzaP8I1rgEJqO6++Ehv62bhM6cKytarZLoCpSs0YU5w3BQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:53:44.562811Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.00646","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:28e8d63bebd84149d6c37371aee7373c1b0d860e817bdd1c234ac965e7e56b71","sha256:e20c56076d269cf2875910d6058b1f2655abb2bc34ddac5159f1a31bf8419fa3"],"state_sha256":"86b1122e64bd11ee7d44accef4bd31894bc7e018506bf1d8d4ac08751af2b0f3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GRFkzjF3jUFZceYIJTK4fdU4N+ygC4F0hntzf2rOhDuMI1hRVOMMNJNfeImyM+lme9eoIG+1AxJhkhJFuBXxDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T23:20:16.268163Z","bundle_sha256":"5dad8991a89d4d3ccc5e0551966897fd52b859c6fa7ff8b03197cbe24b25499a"}}