{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:A7NEETIN4E7PYPZ7G5ABPY3QKB","short_pith_number":"pith:A7NEETIN","canonical_record":{"source":{"id":"1612.08301","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-12-25T22:13:06Z","cross_cats_sorted":[],"title_canon_sha256":"0aa6651aede2bd44634b176b13cdd86fc8f6f2f53206e8338fb16f6d7cade3d1","abstract_canon_sha256":"71ab6027e5fea0ebabd3880353a162012687d0066e86c6da48171893999a55e2"},"schema_version":"1.0"},"canonical_sha256":"07da424d0de13efc3f3f374017e37050775146993b77069ecf41b39985be027a","source":{"kind":"arxiv","id":"1612.08301","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.08301","created_at":"2026-05-18T00:53:57Z"},{"alias_kind":"arxiv_version","alias_value":"1612.08301v1","created_at":"2026-05-18T00:53:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.08301","created_at":"2026-05-18T00:53:57Z"},{"alias_kind":"pith_short_12","alias_value":"A7NEETIN4E7P","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"A7NEETIN4E7PYPZ7","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"A7NEETIN","created_at":"2026-05-18T12:30:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:A7NEETIN4E7PYPZ7G5ABPY3QKB","target":"record","payload":{"canonical_record":{"source":{"id":"1612.08301","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-12-25T22:13:06Z","cross_cats_sorted":[],"title_canon_sha256":"0aa6651aede2bd44634b176b13cdd86fc8f6f2f53206e8338fb16f6d7cade3d1","abstract_canon_sha256":"71ab6027e5fea0ebabd3880353a162012687d0066e86c6da48171893999a55e2"},"schema_version":"1.0"},"canonical_sha256":"07da424d0de13efc3f3f374017e37050775146993b77069ecf41b39985be027a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:57.026816Z","signature_b64":"xAfcZg4YiBHbdFkGYygd3mc5bFd7DBXbD6Pd9tS2Zv+BEUqjFWxooRK+V9przfdsYpAf77K/0KyJJFBUe6K6Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"07da424d0de13efc3f3f374017e37050775146993b77069ecf41b39985be027a","last_reissued_at":"2026-05-18T00:53:57.026127Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:57.026127Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1612.08301","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-05-18T00:53:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JVjYBToHoD3XRO0G2jdFtlPah2h6ATgjYvlTCJZyre4k+YBmc2ku5QpVqEGTuXgYQfvc6f2hNii3XzRGxydWCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T11:42:30.321470Z"},"content_sha256":"d4eab22f95266d00d73966f29bbd41bfe28f53a8e78089e0a0a2a54e9f8c9b2a","schema_version":"1.0","event_id":"sha256:d4eab22f95266d00d73966f29bbd41bfe28f53a8e78089e0a0a2a54e9f8c9b2a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:A7NEETIN4E7PYPZ7G5ABPY3QKB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bounds on the 2-domination number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Csilla Bujt\\'as, Szil\\'ard Jask\\'o","submitted_at":"2016-12-25T22:13:06Z","abstract_excerpt":"In a graph $G$, a set $D\\subseteq V(G)$ is called 2-dominating set if each vertex not in $D$ has at least two neighbors in $D$. The 2-domination number $\\gamma_2(G)$ is the minimum cardinality of such a set $D$. We give a method for the construction of 2-dominating sets, which also yields upper bounds on the 2-domination number in terms of the number of vertices, if the minimum degree $\\delta(G)$ is fixed. These improve the best earlier bounds for any $6 \\le \\delta(G) \\le 21$. In particular, we prove that $\\gamma_2(G)$ is strictly smaller than $n/2$, if $\\delta(G) \\ge 6$. Our proof technique u"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.08301","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":""},"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:53:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P7+cHPFTuQYhj/xumksLt2QjHbs3sPyhVcJxpxxqXLArfcIRpPA5PcomH1JrVQ9yKNDB8zlqYLv2NX2GP7zbAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T11:42:30.322142Z"},"content_sha256":"c34e226482ee64a6df66a75d138cfd52b61d9b0ed95b4033b90a128c4056ff8f","schema_version":"1.0","event_id":"sha256:c34e226482ee64a6df66a75d138cfd52b61d9b0ed95b4033b90a128c4056ff8f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A7NEETIN4E7PYPZ7G5ABPY3QKB/bundle.json","state_url":"https://pith.science/pith/A7NEETIN4E7PYPZ7G5ABPY3QKB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A7NEETIN4E7PYPZ7G5ABPY3QKB/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-11T11:42:30Z","links":{"resolver":"https://pith.science/pith/A7NEETIN4E7PYPZ7G5ABPY3QKB","bundle":"https://pith.science/pith/A7NEETIN4E7PYPZ7G5ABPY3QKB/bundle.json","state":"https://pith.science/pith/A7NEETIN4E7PYPZ7G5ABPY3QKB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A7NEETIN4E7PYPZ7G5ABPY3QKB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:A7NEETIN4E7PYPZ7G5ABPY3QKB","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":"71ab6027e5fea0ebabd3880353a162012687d0066e86c6da48171893999a55e2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-12-25T22:13:06Z","title_canon_sha256":"0aa6651aede2bd44634b176b13cdd86fc8f6f2f53206e8338fb16f6d7cade3d1"},"schema_version":"1.0","source":{"id":"1612.08301","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.08301","created_at":"2026-05-18T00:53:57Z"},{"alias_kind":"arxiv_version","alias_value":"1612.08301v1","created_at":"2026-05-18T00:53:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.08301","created_at":"2026-05-18T00:53:57Z"},{"alias_kind":"pith_short_12","alias_value":"A7NEETIN4E7P","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"A7NEETIN4E7PYPZ7","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"A7NEETIN","created_at":"2026-05-18T12:30:04Z"}],"graph_snapshots":[{"event_id":"sha256:c34e226482ee64a6df66a75d138cfd52b61d9b0ed95b4033b90a128c4056ff8f","target":"graph","created_at":"2026-05-18T00:53:57Z","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":"In a graph $G$, a set $D\\subseteq V(G)$ is called 2-dominating set if each vertex not in $D$ has at least two neighbors in $D$. The 2-domination number $\\gamma_2(G)$ is the minimum cardinality of such a set $D$. We give a method for the construction of 2-dominating sets, which also yields upper bounds on the 2-domination number in terms of the number of vertices, if the minimum degree $\\delta(G)$ is fixed. These improve the best earlier bounds for any $6 \\le \\delta(G) \\le 21$. In particular, we prove that $\\gamma_2(G)$ is strictly smaller than $n/2$, if $\\delta(G) \\ge 6$. Our proof technique u","authors_text":"Csilla Bujt\\'as, Szil\\'ard Jask\\'o","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-12-25T22:13:06Z","title":"Bounds on the 2-domination number"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.08301","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:d4eab22f95266d00d73966f29bbd41bfe28f53a8e78089e0a0a2a54e9f8c9b2a","target":"record","created_at":"2026-05-18T00:53:57Z","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":"71ab6027e5fea0ebabd3880353a162012687d0066e86c6da48171893999a55e2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-12-25T22:13:06Z","title_canon_sha256":"0aa6651aede2bd44634b176b13cdd86fc8f6f2f53206e8338fb16f6d7cade3d1"},"schema_version":"1.0","source":{"id":"1612.08301","kind":"arxiv","version":1}},"canonical_sha256":"07da424d0de13efc3f3f374017e37050775146993b77069ecf41b39985be027a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"07da424d0de13efc3f3f374017e37050775146993b77069ecf41b39985be027a","first_computed_at":"2026-05-18T00:53:57.026127Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:53:57.026127Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xAfcZg4YiBHbdFkGYygd3mc5bFd7DBXbD6Pd9tS2Zv+BEUqjFWxooRK+V9przfdsYpAf77K/0KyJJFBUe6K6Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:53:57.026816Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.08301","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d4eab22f95266d00d73966f29bbd41bfe28f53a8e78089e0a0a2a54e9f8c9b2a","sha256:c34e226482ee64a6df66a75d138cfd52b61d9b0ed95b4033b90a128c4056ff8f"],"state_sha256":"d311a35193fff08cc52e292a3797e9d66595388da58b30d797e524f7607e70a0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/nYws6WKjMqNDTjD3uNdWTuvgVl9boRZ16BNNf2VOwdkXYzKx/eQCHUiwRQTTlRtq8zauNoc8zzzZJX6x6MWAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T11:42:30.325707Z","bundle_sha256":"053b40593d2c2841856158075e04d51e95fa83a7419a4aaf93462e9296f2490c"}}