{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:DDX5V66XXOAHGWJSOQIH7A3U5N","short_pith_number":"pith:DDX5V66X","canonical_record":{"source":{"id":"1409.4116","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-09-14T23:22:09Z","cross_cats_sorted":[],"title_canon_sha256":"20338904ae2690917d2148b3f3c082e9f4d2379405e94afd9b19b39337acc7af","abstract_canon_sha256":"d5b611b9836209256bb80717d416b1770cac258964dd7d73505a8bd0003649c1"},"schema_version":"1.0"},"canonical_sha256":"18efdafbd7bb8073593274107f8374eb75416d7c7261e00e4fa679650cbd35d8","source":{"kind":"arxiv","id":"1409.4116","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.4116","created_at":"2026-05-18T02:42:53Z"},{"alias_kind":"arxiv_version","alias_value":"1409.4116v1","created_at":"2026-05-18T02:42:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.4116","created_at":"2026-05-18T02:42:53Z"},{"alias_kind":"pith_short_12","alias_value":"DDX5V66XXOAH","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"DDX5V66XXOAHGWJS","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"DDX5V66X","created_at":"2026-05-18T12:28:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:DDX5V66XXOAHGWJSOQIH7A3U5N","target":"record","payload":{"canonical_record":{"source":{"id":"1409.4116","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-09-14T23:22:09Z","cross_cats_sorted":[],"title_canon_sha256":"20338904ae2690917d2148b3f3c082e9f4d2379405e94afd9b19b39337acc7af","abstract_canon_sha256":"d5b611b9836209256bb80717d416b1770cac258964dd7d73505a8bd0003649c1"},"schema_version":"1.0"},"canonical_sha256":"18efdafbd7bb8073593274107f8374eb75416d7c7261e00e4fa679650cbd35d8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:42:53.021857Z","signature_b64":"VOgjqCGhW2OP5P+BilnmGHIXFVgjqm4QYO2+QeU8oH3HyQ2BOqrMmum+fh+Dkttgt8RQ2LWNUnPMvQRyL94FAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"18efdafbd7bb8073593274107f8374eb75416d7c7261e00e4fa679650cbd35d8","last_reissued_at":"2026-05-18T02:42:53.021454Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:42:53.021454Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1409.4116","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-18T02:42:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OWpluho3D0d/pB0kreqSldrR7l8ZiqVta43msXGCNADXSnXyTRj0qg6Iwgia+U8tn0xNrsyUtBJDzoZOqWlJBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T08:37:34.803234Z"},"content_sha256":"66dc792fd06b33d6df8375bb5c08a801c531c2d771450fa8dc34d5db5c4df98e","schema_version":"1.0","event_id":"sha256:66dc792fd06b33d6df8375bb5c08a801c531c2d771450fa8dc34d5db5c4df98e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:DDX5V66XXOAHGWJSOQIH7A3U5N","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Domination Number and Distance in Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Cong X. Kang","submitted_at":"2014-09-14T23:22:09Z","abstract_excerpt":"A vertex set $S$ of a graph $G$ is a \\emph{dominating set} if each vertex of $G$ either belongs to $S$ or is adjacent to a vertex in $S$. The \\emph{domination number} $\\gamma(G)$ of $G$ is the minimum cardinality of $S$ as $S$ varies over all dominating sets of $G$. It is known that $\\gamma(G) \\ge \\frac{1}{3}(diam(G)+1)$, where $diam(G)$ denotes the diameter of $G$. Define $C_r$ as the largest constant such that $\\gamma(G) \\ge C_r \\sum_{1 \\le i < j \\le r}d(x_i, x_j)$ for any $r$ vertices of an arbitrary connected graph $G$; then $C_2=\\frac{1}{3}$ in this view. The main result of this paper is "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.4116","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-18T02:42:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8O4L29+T7M+uvL6e/dvnu7bFe0bFckp0MFRvvjmGnimi5Y2WeoWQPjjJH0IA11gA0RbFfCR31s4ruEmQ2i7YCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T08:37:34.803596Z"},"content_sha256":"bb5cb1a30883bd5cbb222a507793aabcd9d44be6b2efc8ffb5434f6bd986136d","schema_version":"1.0","event_id":"sha256:bb5cb1a30883bd5cbb222a507793aabcd9d44be6b2efc8ffb5434f6bd986136d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DDX5V66XXOAHGWJSOQIH7A3U5N/bundle.json","state_url":"https://pith.science/pith/DDX5V66XXOAHGWJSOQIH7A3U5N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DDX5V66XXOAHGWJSOQIH7A3U5N/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-25T08:37:34Z","links":{"resolver":"https://pith.science/pith/DDX5V66XXOAHGWJSOQIH7A3U5N","bundle":"https://pith.science/pith/DDX5V66XXOAHGWJSOQIH7A3U5N/bundle.json","state":"https://pith.science/pith/DDX5V66XXOAHGWJSOQIH7A3U5N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DDX5V66XXOAHGWJSOQIH7A3U5N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:DDX5V66XXOAHGWJSOQIH7A3U5N","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":"d5b611b9836209256bb80717d416b1770cac258964dd7d73505a8bd0003649c1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-09-14T23:22:09Z","title_canon_sha256":"20338904ae2690917d2148b3f3c082e9f4d2379405e94afd9b19b39337acc7af"},"schema_version":"1.0","source":{"id":"1409.4116","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.4116","created_at":"2026-05-18T02:42:53Z"},{"alias_kind":"arxiv_version","alias_value":"1409.4116v1","created_at":"2026-05-18T02:42:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.4116","created_at":"2026-05-18T02:42:53Z"},{"alias_kind":"pith_short_12","alias_value":"DDX5V66XXOAH","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"DDX5V66XXOAHGWJS","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"DDX5V66X","created_at":"2026-05-18T12:28:25Z"}],"graph_snapshots":[{"event_id":"sha256:bb5cb1a30883bd5cbb222a507793aabcd9d44be6b2efc8ffb5434f6bd986136d","target":"graph","created_at":"2026-05-18T02:42:53Z","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":"A vertex set $S$ of a graph $G$ is a \\emph{dominating set} if each vertex of $G$ either belongs to $S$ or is adjacent to a vertex in $S$. The \\emph{domination number} $\\gamma(G)$ of $G$ is the minimum cardinality of $S$ as $S$ varies over all dominating sets of $G$. It is known that $\\gamma(G) \\ge \\frac{1}{3}(diam(G)+1)$, where $diam(G)$ denotes the diameter of $G$. Define $C_r$ as the largest constant such that $\\gamma(G) \\ge C_r \\sum_{1 \\le i < j \\le r}d(x_i, x_j)$ for any $r$ vertices of an arbitrary connected graph $G$; then $C_2=\\frac{1}{3}$ in this view. The main result of this paper is ","authors_text":"Cong X. Kang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-09-14T23:22:09Z","title":"On Domination Number and Distance in Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.4116","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:66dc792fd06b33d6df8375bb5c08a801c531c2d771450fa8dc34d5db5c4df98e","target":"record","created_at":"2026-05-18T02:42:53Z","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":"d5b611b9836209256bb80717d416b1770cac258964dd7d73505a8bd0003649c1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-09-14T23:22:09Z","title_canon_sha256":"20338904ae2690917d2148b3f3c082e9f4d2379405e94afd9b19b39337acc7af"},"schema_version":"1.0","source":{"id":"1409.4116","kind":"arxiv","version":1}},"canonical_sha256":"18efdafbd7bb8073593274107f8374eb75416d7c7261e00e4fa679650cbd35d8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"18efdafbd7bb8073593274107f8374eb75416d7c7261e00e4fa679650cbd35d8","first_computed_at":"2026-05-18T02:42:53.021454Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:42:53.021454Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VOgjqCGhW2OP5P+BilnmGHIXFVgjqm4QYO2+QeU8oH3HyQ2BOqrMmum+fh+Dkttgt8RQ2LWNUnPMvQRyL94FAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:42:53.021857Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.4116","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:66dc792fd06b33d6df8375bb5c08a801c531c2d771450fa8dc34d5db5c4df98e","sha256:bb5cb1a30883bd5cbb222a507793aabcd9d44be6b2efc8ffb5434f6bd986136d"],"state_sha256":"a43f8f03c6c6c951de5f932b47d86243d797018bf50178aed6089ebe92203ae0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XLxIZRPN9x1IlReaq60zEGs1AMM/xfRUzDq1tIZq9HWyyGEdLjfEq9aswvPOX5Ws9LE6UqdgzVS/z63UoGFVAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T08:37:34.805603Z","bundle_sha256":"c10cf1a80b30a8de4d7e244037ba282d3b1bb05734ccabd8f7fd0e15093523ff"}}