{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:57TB6XITNRDM76UQJM7TFKI7DW","short_pith_number":"pith:57TB6XIT","canonical_record":{"source":{"id":"1207.2142","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-07-09T19:57:13Z","cross_cats_sorted":[],"title_canon_sha256":"2b08f20f28737fc9d06071455147b62e95436f629b8325978d713cffa4f7db5a","abstract_canon_sha256":"020ce871ec1a138cd00935250b74b9b3459a9c0a1d455a7461e415362289683c"},"schema_version":"1.0"},"canonical_sha256":"efe61f5d136c46cffa904b3f32a91f1d8d30a3c234f1c9749a5198179134ecd2","source":{"kind":"arxiv","id":"1207.2142","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.2142","created_at":"2026-05-18T03:49:59Z"},{"alias_kind":"arxiv_version","alias_value":"1207.2142v2","created_at":"2026-05-18T03:49:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.2142","created_at":"2026-05-18T03:49:59Z"},{"alias_kind":"pith_short_12","alias_value":"57TB6XITNRDM","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"57TB6XITNRDM76UQ","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"57TB6XIT","created_at":"2026-05-18T12:26:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:57TB6XITNRDM76UQJM7TFKI7DW","target":"record","payload":{"canonical_record":{"source":{"id":"1207.2142","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-07-09T19:57:13Z","cross_cats_sorted":[],"title_canon_sha256":"2b08f20f28737fc9d06071455147b62e95436f629b8325978d713cffa4f7db5a","abstract_canon_sha256":"020ce871ec1a138cd00935250b74b9b3459a9c0a1d455a7461e415362289683c"},"schema_version":"1.0"},"canonical_sha256":"efe61f5d136c46cffa904b3f32a91f1d8d30a3c234f1c9749a5198179134ecd2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:49:59.454789Z","signature_b64":"pmn8slz795iCkh2/JTTMTgHB98NDbPi6VjCkVkXDuBkBesRcvnf4JLFaj0Qk2Ffwt1TAe+UfN+1kLc8fzmcoCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"efe61f5d136c46cffa904b3f32a91f1d8d30a3c234f1c9749a5198179134ecd2","last_reissued_at":"2026-05-18T03:49:59.454241Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:49:59.454241Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.2142","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-18T03:49:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SDtuKJZQvs62+f6UlUNiMUYlyzEMcCGmMnRoYcW5Vm0zNTJe6q+Rq4UIgLHE5Hn2+F6cMHBsoisu9cbKY+sNCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T20:09:41.258833Z"},"content_sha256":"70a79d375574864472343f788fd015b483711139792282ca8ef4d98ff1fa3ca1","schema_version":"1.0","event_id":"sha256:70a79d375574864472343f788fd015b483711139792282ca8ef4d98ff1fa3ca1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:57TB6XITNRDM76UQJM7TFKI7DW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Nordhaus-Gaddum bounds for locating domination","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"C. Hernando, I. M. Pelayo, M. Mora","submitted_at":"2012-07-09T19:57:13Z","abstract_excerpt":"A dominating set S of graph G is called metric-locating-dominating if it is also locating, that is, if every vertex v is uniquely determined by its vector of distances to the vertices in S. If moreover, every vertex v not in S is also uniquely determined by the set of neighbors of v belonging to S, then it is said to be locating-dominating. Locating, metric-locating-dominating and locating-dominating sets of minimum cardinality are called b-codes, e-codes and l-codes, respectively. A Nordhaus-Gaddum bound is a tight lower or upper bound on the sum or product of a parameter of a graph G and its"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.2142","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-18T03:49:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tR80ePHqs3K9SqY+NvtO/lo+JIcjm4Fkc1X9MkV1r/VH0m4eNxN0ONZA1Cv7RPEVJtQ0QBwq33bRp6dS7cffCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T20:09:41.259186Z"},"content_sha256":"40a270336921eae67d95324040434b1364d452827ecca62a7008dde19aa74e5c","schema_version":"1.0","event_id":"sha256:40a270336921eae67d95324040434b1364d452827ecca62a7008dde19aa74e5c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/57TB6XITNRDM76UQJM7TFKI7DW/bundle.json","state_url":"https://pith.science/pith/57TB6XITNRDM76UQJM7TFKI7DW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/57TB6XITNRDM76UQJM7TFKI7DW/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-23T20:09:41Z","links":{"resolver":"https://pith.science/pith/57TB6XITNRDM76UQJM7TFKI7DW","bundle":"https://pith.science/pith/57TB6XITNRDM76UQJM7TFKI7DW/bundle.json","state":"https://pith.science/pith/57TB6XITNRDM76UQJM7TFKI7DW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/57TB6XITNRDM76UQJM7TFKI7DW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:57TB6XITNRDM76UQJM7TFKI7DW","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":"020ce871ec1a138cd00935250b74b9b3459a9c0a1d455a7461e415362289683c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-07-09T19:57:13Z","title_canon_sha256":"2b08f20f28737fc9d06071455147b62e95436f629b8325978d713cffa4f7db5a"},"schema_version":"1.0","source":{"id":"1207.2142","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.2142","created_at":"2026-05-18T03:49:59Z"},{"alias_kind":"arxiv_version","alias_value":"1207.2142v2","created_at":"2026-05-18T03:49:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.2142","created_at":"2026-05-18T03:49:59Z"},{"alias_kind":"pith_short_12","alias_value":"57TB6XITNRDM","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"57TB6XITNRDM76UQ","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"57TB6XIT","created_at":"2026-05-18T12:26:53Z"}],"graph_snapshots":[{"event_id":"sha256:40a270336921eae67d95324040434b1364d452827ecca62a7008dde19aa74e5c","target":"graph","created_at":"2026-05-18T03:49:59Z","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 dominating set S of graph G is called metric-locating-dominating if it is also locating, that is, if every vertex v is uniquely determined by its vector of distances to the vertices in S. If moreover, every vertex v not in S is also uniquely determined by the set of neighbors of v belonging to S, then it is said to be locating-dominating. Locating, metric-locating-dominating and locating-dominating sets of minimum cardinality are called b-codes, e-codes and l-codes, respectively. A Nordhaus-Gaddum bound is a tight lower or upper bound on the sum or product of a parameter of a graph G and its","authors_text":"C. Hernando, I. M. Pelayo, M. Mora","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-07-09T19:57:13Z","title":"Nordhaus-Gaddum bounds for locating domination"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.2142","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:70a79d375574864472343f788fd015b483711139792282ca8ef4d98ff1fa3ca1","target":"record","created_at":"2026-05-18T03:49:59Z","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":"020ce871ec1a138cd00935250b74b9b3459a9c0a1d455a7461e415362289683c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-07-09T19:57:13Z","title_canon_sha256":"2b08f20f28737fc9d06071455147b62e95436f629b8325978d713cffa4f7db5a"},"schema_version":"1.0","source":{"id":"1207.2142","kind":"arxiv","version":2}},"canonical_sha256":"efe61f5d136c46cffa904b3f32a91f1d8d30a3c234f1c9749a5198179134ecd2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"efe61f5d136c46cffa904b3f32a91f1d8d30a3c234f1c9749a5198179134ecd2","first_computed_at":"2026-05-18T03:49:59.454241Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:49:59.454241Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pmn8slz795iCkh2/JTTMTgHB98NDbPi6VjCkVkXDuBkBesRcvnf4JLFaj0Qk2Ffwt1TAe+UfN+1kLc8fzmcoCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:49:59.454789Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.2142","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:70a79d375574864472343f788fd015b483711139792282ca8ef4d98ff1fa3ca1","sha256:40a270336921eae67d95324040434b1364d452827ecca62a7008dde19aa74e5c"],"state_sha256":"97657da5fa09ca066c6de8453925103cab7783a223a3be4cd98db640755728dd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2n9lyyQMF+HiIXJMv/t4KNrhD+TmMaezNUzT+lE4E/VDrBwn5RUHb3W2q1mNzxDZODb4dZbbxQD8KFqgs84ZDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T20:09:41.261141Z","bundle_sha256":"f94b6ac41cabe7082a23f21c119c964d900b7d4f7b15404fbbd2223a4907601e"}}