{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:7FYKUG62R32KP2ZMAXC4D54P6J","short_pith_number":"pith:7FYKUG62","canonical_record":{"source":{"id":"1907.07866","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-18T03:59:36Z","cross_cats_sorted":[],"title_canon_sha256":"e9dfc39357f94d2cefac72aa1975349209e906d910bebec5cc141ab7a5ebddbf","abstract_canon_sha256":"5eef079bee3cff165bb1f1a895739b5b01672ef374eda88cb961469acb45c31b"},"schema_version":"1.0"},"canonical_sha256":"f970aa1bda8ef4a7eb2c05c5c1f78ff26131c69172eb13edf2e66cffa50bd789","source":{"kind":"arxiv","id":"1907.07866","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.07866","created_at":"2026-07-05T02:04:03Z"},{"alias_kind":"arxiv_version","alias_value":"1907.07866v2","created_at":"2026-07-05T02:04:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.07866","created_at":"2026-07-05T02:04:03Z"},{"alias_kind":"pith_short_12","alias_value":"7FYKUG62R32K","created_at":"2026-07-05T02:04:03Z"},{"alias_kind":"pith_short_16","alias_value":"7FYKUG62R32KP2ZM","created_at":"2026-07-05T02:04:03Z"},{"alias_kind":"pith_short_8","alias_value":"7FYKUG62","created_at":"2026-07-05T02:04:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:7FYKUG62R32KP2ZMAXC4D54P6J","target":"record","payload":{"canonical_record":{"source":{"id":"1907.07866","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-18T03:59:36Z","cross_cats_sorted":[],"title_canon_sha256":"e9dfc39357f94d2cefac72aa1975349209e906d910bebec5cc141ab7a5ebddbf","abstract_canon_sha256":"5eef079bee3cff165bb1f1a895739b5b01672ef374eda88cb961469acb45c31b"},"schema_version":"1.0"},"canonical_sha256":"f970aa1bda8ef4a7eb2c05c5c1f78ff26131c69172eb13edf2e66cffa50bd789","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:04:03.580177Z","signature_b64":"tvYEcliHFLFPsMzx8FV2pqoXB2RllgaDMDpFnljSy/+zBRxZo8pl+tXsbMh7olnIM4YrkoqKqaIsl7fYxnKQBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f970aa1bda8ef4a7eb2c05c5c1f78ff26131c69172eb13edf2e66cffa50bd789","last_reissued_at":"2026-07-05T02:04:03.579797Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:04:03.579797Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.07866","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-07-05T02:04:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DFaT4tlNjM/DIioh3/bc6xGDKOJ1o+PJyU7XyWhLMVIogYgvWbzOe/IGe5wKzd0Ci5Uinc2YHNiAzx0gD2qoAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T08:44:17.675335Z"},"content_sha256":"2f8cb84686e9a8bbaa0ec2d20fbbd65142c4d8365e0d127266e47ab29d3f1934","schema_version":"1.0","event_id":"sha256:2f8cb84686e9a8bbaa0ec2d20fbbd65142c4d8365e0d127266e47ab29d3f1934"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:7FYKUG62R32KP2ZMAXC4D54P6J","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the equality of domination number and $ 2 $-domination number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Csilla Bujt\\'as, G\\\"ulnaz Boruzanl{\\i} Ekinci","submitted_at":"2019-07-18T03:59:36Z","abstract_excerpt":"The 2-domination number $\\gamma_2(G)$ of a graph $G$ is the minimum cardinality of a set $ D \\subseteq V(G) $ for which every vertex outside $ D $ is adjacent to at least two vertices in $ D $. Clearly, $ \\gamma_2(G) $ cannot be smaller than the domination number $ \\gamma(G) $. We consider a large class of graphs and characterize those members which satisfy $\\gamma_2=\\gamma$. For the general case, we prove that it is NP-hard to decide whether $\\gamma_2=\\gamma$ holds. We also give a necessary and sufficient condition for a graph to satisfy the equality hereditarily."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.07866","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1907.07866/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-05T02:04:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ttFkhg0cEs0MEQr1sXKgRXgOXTjkDDHukZTAIjevkdPQf781XEMi4GKYnIIvT0cOlVgNhMiyfGjFbhnxUZw5Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T08:44:17.676302Z"},"content_sha256":"a72f3cbc852d083adbcf6fee6432103bf619df78643984bb3e5fcd0235daa0c8","schema_version":"1.0","event_id":"sha256:a72f3cbc852d083adbcf6fee6432103bf619df78643984bb3e5fcd0235daa0c8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7FYKUG62R32KP2ZMAXC4D54P6J/bundle.json","state_url":"https://pith.science/pith/7FYKUG62R32KP2ZMAXC4D54P6J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7FYKUG62R32KP2ZMAXC4D54P6J/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-16T08:44:17Z","links":{"resolver":"https://pith.science/pith/7FYKUG62R32KP2ZMAXC4D54P6J","bundle":"https://pith.science/pith/7FYKUG62R32KP2ZMAXC4D54P6J/bundle.json","state":"https://pith.science/pith/7FYKUG62R32KP2ZMAXC4D54P6J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7FYKUG62R32KP2ZMAXC4D54P6J/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:7FYKUG62R32KP2ZMAXC4D54P6J","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":"5eef079bee3cff165bb1f1a895739b5b01672ef374eda88cb961469acb45c31b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-18T03:59:36Z","title_canon_sha256":"e9dfc39357f94d2cefac72aa1975349209e906d910bebec5cc141ab7a5ebddbf"},"schema_version":"1.0","source":{"id":"1907.07866","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.07866","created_at":"2026-07-05T02:04:03Z"},{"alias_kind":"arxiv_version","alias_value":"1907.07866v2","created_at":"2026-07-05T02:04:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.07866","created_at":"2026-07-05T02:04:03Z"},{"alias_kind":"pith_short_12","alias_value":"7FYKUG62R32K","created_at":"2026-07-05T02:04:03Z"},{"alias_kind":"pith_short_16","alias_value":"7FYKUG62R32KP2ZM","created_at":"2026-07-05T02:04:03Z"},{"alias_kind":"pith_short_8","alias_value":"7FYKUG62","created_at":"2026-07-05T02:04:03Z"}],"graph_snapshots":[{"event_id":"sha256:a72f3cbc852d083adbcf6fee6432103bf619df78643984bb3e5fcd0235daa0c8","target":"graph","created_at":"2026-07-05T02:04:03Z","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/1907.07866/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The 2-domination number $\\gamma_2(G)$ of a graph $G$ is the minimum cardinality of a set $ D \\subseteq V(G) $ for which every vertex outside $ D $ is adjacent to at least two vertices in $ D $. Clearly, $ \\gamma_2(G) $ cannot be smaller than the domination number $ \\gamma(G) $. We consider a large class of graphs and characterize those members which satisfy $\\gamma_2=\\gamma$. For the general case, we prove that it is NP-hard to decide whether $\\gamma_2=\\gamma$ holds. We also give a necessary and sufficient condition for a graph to satisfy the equality hereditarily.","authors_text":"Csilla Bujt\\'as, G\\\"ulnaz Boruzanl{\\i} Ekinci","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-18T03:59:36Z","title":"On the equality of domination number and $ 2 $-domination number"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.07866","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:2f8cb84686e9a8bbaa0ec2d20fbbd65142c4d8365e0d127266e47ab29d3f1934","target":"record","created_at":"2026-07-05T02:04:03Z","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":"5eef079bee3cff165bb1f1a895739b5b01672ef374eda88cb961469acb45c31b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-18T03:59:36Z","title_canon_sha256":"e9dfc39357f94d2cefac72aa1975349209e906d910bebec5cc141ab7a5ebddbf"},"schema_version":"1.0","source":{"id":"1907.07866","kind":"arxiv","version":2}},"canonical_sha256":"f970aa1bda8ef4a7eb2c05c5c1f78ff26131c69172eb13edf2e66cffa50bd789","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f970aa1bda8ef4a7eb2c05c5c1f78ff26131c69172eb13edf2e66cffa50bd789","first_computed_at":"2026-07-05T02:04:03.579797Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:04:03.579797Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tvYEcliHFLFPsMzx8FV2pqoXB2RllgaDMDpFnljSy/+zBRxZo8pl+tXsbMh7olnIM4YrkoqKqaIsl7fYxnKQBA==","signature_status":"signed_v1","signed_at":"2026-07-05T02:04:03.580177Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.07866","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2f8cb84686e9a8bbaa0ec2d20fbbd65142c4d8365e0d127266e47ab29d3f1934","sha256:a72f3cbc852d083adbcf6fee6432103bf619df78643984bb3e5fcd0235daa0c8"],"state_sha256":"3cc062fc7e9f4abb995c09f37cce528e016ea1ee3efcc0fb0d2bb8234beff5b0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6KDqtOHdmG1YBtLP1j3rvCmxozzjKcn8OUFRLXa3lY4yOA2uVXKBMduiKZa27MBwF9hYEqKou0frKCYU7YHRBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T08:44:17.680741Z","bundle_sha256":"b3f554b006a4fde10c11d1d5355604250edfa5fc895f0101fffd1cc91588add0"}}