{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:E576L5VAEIG5SQFGPHHA42TWBS","short_pith_number":"pith:E576L5VA","canonical_record":{"source":{"id":"1407.7263","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-07-27T17:39:34Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"f513eabb5b7eb33fc942ae32867c6d68334a235c9163246c9ab8417bb2b6663f","abstract_canon_sha256":"6071b50f92a7377fe0e1c112f83ec50c8367207aa91f4efad887a716a28a12d7"},"schema_version":"1.0"},"canonical_sha256":"277fe5f6a0220dd940a679ce0e6a760cbf875af500ec46000a4ccb6660f5305f","source":{"kind":"arxiv","id":"1407.7263","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.7263","created_at":"2026-05-18T01:26:10Z"},{"alias_kind":"arxiv_version","alias_value":"1407.7263v2","created_at":"2026-05-18T01:26:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.7263","created_at":"2026-05-18T01:26:10Z"},{"alias_kind":"pith_short_12","alias_value":"E576L5VAEIG5","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"E576L5VAEIG5SQFG","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"E576L5VA","created_at":"2026-05-18T12:28:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:E576L5VAEIG5SQFGPHHA42TWBS","target":"record","payload":{"canonical_record":{"source":{"id":"1407.7263","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-07-27T17:39:34Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"f513eabb5b7eb33fc942ae32867c6d68334a235c9163246c9ab8417bb2b6663f","abstract_canon_sha256":"6071b50f92a7377fe0e1c112f83ec50c8367207aa91f4efad887a716a28a12d7"},"schema_version":"1.0"},"canonical_sha256":"277fe5f6a0220dd940a679ce0e6a760cbf875af500ec46000a4ccb6660f5305f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:26:10.924180Z","signature_b64":"Mv96qFNzNcFtqZ4rkSuSEo3YXSa0l78+Eo/SkukA0BG6e2+bcO4FjNStCltBRwesFuurJNfd/KV837QVVgU5BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"277fe5f6a0220dd940a679ce0e6a760cbf875af500ec46000a4ccb6660f5305f","last_reissued_at":"2026-05-18T01:26:10.923681Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:26:10.923681Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1407.7263","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-18T01:26:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2LoFJmfOzhyTIXrNCoNklR++fDy5Jfsfmh5rooTEtdQhLnhSQC1ZK/g6YmntJ/7aX1cWWk7ourIqPlm2trd5CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T06:48:52.922970Z"},"content_sha256":"2d4389c97aa1f7800b406367273ad4e0f4474478eacc991fbd71976492490a99","schema_version":"1.0","event_id":"sha256:2d4389c97aa1f7800b406367273ad4e0f4474478eacc991fbd71976492490a99"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:E576L5VAEIG5SQFGPHHA42TWBS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Locating-dominating sets and identifying codes in graphs of girth at least 5","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Adriana Hansberg, Camino Balbuena, Florent Foucaud","submitted_at":"2014-07-27T17:39:34Z","abstract_excerpt":"Locating-dominating sets and identifying codes are two closely related notions in the area of separating systems. Roughly speaking, they consist in a dominating set of a graph such that every vertex is uniquely identified by its neighbourhood within the dominating set. In this paper, we study the size of a smallest locating-dominating set or identifying code for graphs of girth at least 5 and of given minimum degree. We use the technique of vertex-disjoint paths to provide upper bounds on the minimum size of such sets, and construct graphs who come close to meet these bounds."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.7263","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-18T01:26:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3sxnIZSGErALJden1ZUi2N1pISE/EH+JCD0MgvYnWL2lsG/Lpe36ynzEb9iiPmmqfJxCno+mmtevwjCBcaXbBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T06:48:52.923336Z"},"content_sha256":"6d408b57cab4e3e5cf3be56815e302db537410529002b21b66e7bbb77f214b2a","schema_version":"1.0","event_id":"sha256:6d408b57cab4e3e5cf3be56815e302db537410529002b21b66e7bbb77f214b2a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E576L5VAEIG5SQFGPHHA42TWBS/bundle.json","state_url":"https://pith.science/pith/E576L5VAEIG5SQFGPHHA42TWBS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E576L5VAEIG5SQFGPHHA42TWBS/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-23T06:48:52Z","links":{"resolver":"https://pith.science/pith/E576L5VAEIG5SQFGPHHA42TWBS","bundle":"https://pith.science/pith/E576L5VAEIG5SQFGPHHA42TWBS/bundle.json","state":"https://pith.science/pith/E576L5VAEIG5SQFGPHHA42TWBS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E576L5VAEIG5SQFGPHHA42TWBS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:E576L5VAEIG5SQFGPHHA42TWBS","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":"6071b50f92a7377fe0e1c112f83ec50c8367207aa91f4efad887a716a28a12d7","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-07-27T17:39:34Z","title_canon_sha256":"f513eabb5b7eb33fc942ae32867c6d68334a235c9163246c9ab8417bb2b6663f"},"schema_version":"1.0","source":{"id":"1407.7263","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.7263","created_at":"2026-05-18T01:26:10Z"},{"alias_kind":"arxiv_version","alias_value":"1407.7263v2","created_at":"2026-05-18T01:26:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.7263","created_at":"2026-05-18T01:26:10Z"},{"alias_kind":"pith_short_12","alias_value":"E576L5VAEIG5","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"E576L5VAEIG5SQFG","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"E576L5VA","created_at":"2026-05-18T12:28:25Z"}],"graph_snapshots":[{"event_id":"sha256:6d408b57cab4e3e5cf3be56815e302db537410529002b21b66e7bbb77f214b2a","target":"graph","created_at":"2026-05-18T01:26:10Z","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":"Locating-dominating sets and identifying codes are two closely related notions in the area of separating systems. Roughly speaking, they consist in a dominating set of a graph such that every vertex is uniquely identified by its neighbourhood within the dominating set. In this paper, we study the size of a smallest locating-dominating set or identifying code for graphs of girth at least 5 and of given minimum degree. We use the technique of vertex-disjoint paths to provide upper bounds on the minimum size of such sets, and construct graphs who come close to meet these bounds.","authors_text":"Adriana Hansberg, Camino Balbuena, Florent Foucaud","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-07-27T17:39:34Z","title":"Locating-dominating sets and identifying codes in graphs of girth at least 5"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.7263","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:2d4389c97aa1f7800b406367273ad4e0f4474478eacc991fbd71976492490a99","target":"record","created_at":"2026-05-18T01:26:10Z","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":"6071b50f92a7377fe0e1c112f83ec50c8367207aa91f4efad887a716a28a12d7","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-07-27T17:39:34Z","title_canon_sha256":"f513eabb5b7eb33fc942ae32867c6d68334a235c9163246c9ab8417bb2b6663f"},"schema_version":"1.0","source":{"id":"1407.7263","kind":"arxiv","version":2}},"canonical_sha256":"277fe5f6a0220dd940a679ce0e6a760cbf875af500ec46000a4ccb6660f5305f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"277fe5f6a0220dd940a679ce0e6a760cbf875af500ec46000a4ccb6660f5305f","first_computed_at":"2026-05-18T01:26:10.923681Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:26:10.923681Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Mv96qFNzNcFtqZ4rkSuSEo3YXSa0l78+Eo/SkukA0BG6e2+bcO4FjNStCltBRwesFuurJNfd/KV837QVVgU5BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:26:10.924180Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.7263","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2d4389c97aa1f7800b406367273ad4e0f4474478eacc991fbd71976492490a99","sha256:6d408b57cab4e3e5cf3be56815e302db537410529002b21b66e7bbb77f214b2a"],"state_sha256":"2f28a2f6248ff68bf7436af08e658c89690462ac689dc1017c964669805c3f79"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2ZRlo2JcS1727nhJzVjifv+3uUqgQjKyWTCcvsQk9WL208swcBnsvjSgv4VD976NKCapSafVztw7YrEUeSBCBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T06:48:52.925275Z","bundle_sha256":"fccb7cfbff4066f3917bd1a37f829047545ad10287e191fb3b07eb3a84917a28"}}