{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:2MEET2M62RGZXLQYUSJRKHNAWU","short_pith_number":"pith:2MEET2M6","canonical_record":{"source":{"id":"1412.2376","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-07T17:32:56Z","cross_cats_sorted":[],"title_canon_sha256":"473f8ef4ac8105267f692ca6f8d6023c49ec28444c2e87e44e9379c5344676a9","abstract_canon_sha256":"64ff475cf08f670e4e1ff853c224311f7a8f0374c763750ed9d3ead2beda3ba9"},"schema_version":"1.0"},"canonical_sha256":"d30849e99ed44d9bae18a493151da0b526617222e9c0f19b53a15a2c2e1dc557","source":{"kind":"arxiv","id":"1412.2376","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.2376","created_at":"2026-05-18T01:22:41Z"},{"alias_kind":"arxiv_version","alias_value":"1412.2376v2","created_at":"2026-05-18T01:22:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.2376","created_at":"2026-05-18T01:22:41Z"},{"alias_kind":"pith_short_12","alias_value":"2MEET2M62RGZ","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"2MEET2M62RGZXLQY","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"2MEET2M6","created_at":"2026-05-18T12:28:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:2MEET2M62RGZXLQYUSJRKHNAWU","target":"record","payload":{"canonical_record":{"source":{"id":"1412.2376","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-07T17:32:56Z","cross_cats_sorted":[],"title_canon_sha256":"473f8ef4ac8105267f692ca6f8d6023c49ec28444c2e87e44e9379c5344676a9","abstract_canon_sha256":"64ff475cf08f670e4e1ff853c224311f7a8f0374c763750ed9d3ead2beda3ba9"},"schema_version":"1.0"},"canonical_sha256":"d30849e99ed44d9bae18a493151da0b526617222e9c0f19b53a15a2c2e1dc557","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:22:41.599576Z","signature_b64":"kj7uY8aDTTJOykwqG9BRqJyERMC6A6/qPzukcu11Z6pbWwYGtRTcdt0dCMiaNR/sfn7bOJL6972j7kPl2aQOCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d30849e99ed44d9bae18a493151da0b526617222e9c0f19b53a15a2c2e1dc557","last_reissued_at":"2026-05-18T01:22:41.599153Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:22:41.599153Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1412.2376","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:22:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wW+NGqNDDBxOZEOGRLT72tm96HFqbAOkivJHj7IoDOCJupGo9geF3be9lj8RKKBbCN94S96AC3GQv/r8JLMiBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T06:09:18.535340Z"},"content_sha256":"921442dccda67661f515316962c297e0f1221e2fb97a18edfe033575a75b30f2","schema_version":"1.0","event_id":"sha256:921442dccda67661f515316962c297e0f1221e2fb97a18edfe033575a75b30f2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:2MEET2M62RGZXLQYUSJRKHNAWU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Locating-dominating sets in twin-free graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Christian L\\\"owenstein, Florent Foucaud, Michael A. Henning, Thomas Sasse","submitted_at":"2014-12-07T17:32:56Z","abstract_excerpt":"A locating-dominating set of a graph $G$ is a dominating set $D$ of $G$ with the additional property that every two distinct vertices outside $D$ have distinct neighbors in $D$; that is, for distinct vertices $u$ and $v$ outside $D$, $N(u) \\cap D \\ne N(v) \\cap D$ where $N(u)$ denotes the open neighborhood of $u$. A graph is twin-free if every two distinct vertices have distinct open and closed neighborhoods. The location-domination number of $G$, denoted $\\gamma_L(G)$, is the minimum cardinality of a locating-dominating set in $G$. It is conjectured [D. Garijo, A. Gonz\\'alez and A. M\\'arquez. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.2376","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:22:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rTovtVAIaNNhsTI9T2764Zvy98fhZkrhPCybz9GjkhgVzeGhGYHys8XiVaHowlEyVdbzdJNC1LEOsw/LkpNiCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T06:09:18.536009Z"},"content_sha256":"69f93d5cf01687379533a3140fd87abeda8b8d41a27b6615271d948e034a4994","schema_version":"1.0","event_id":"sha256:69f93d5cf01687379533a3140fd87abeda8b8d41a27b6615271d948e034a4994"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2MEET2M62RGZXLQYUSJRKHNAWU/bundle.json","state_url":"https://pith.science/pith/2MEET2M62RGZXLQYUSJRKHNAWU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2MEET2M62RGZXLQYUSJRKHNAWU/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-04T06:09:18Z","links":{"resolver":"https://pith.science/pith/2MEET2M62RGZXLQYUSJRKHNAWU","bundle":"https://pith.science/pith/2MEET2M62RGZXLQYUSJRKHNAWU/bundle.json","state":"https://pith.science/pith/2MEET2M62RGZXLQYUSJRKHNAWU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2MEET2M62RGZXLQYUSJRKHNAWU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:2MEET2M62RGZXLQYUSJRKHNAWU","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":"64ff475cf08f670e4e1ff853c224311f7a8f0374c763750ed9d3ead2beda3ba9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-07T17:32:56Z","title_canon_sha256":"473f8ef4ac8105267f692ca6f8d6023c49ec28444c2e87e44e9379c5344676a9"},"schema_version":"1.0","source":{"id":"1412.2376","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.2376","created_at":"2026-05-18T01:22:41Z"},{"alias_kind":"arxiv_version","alias_value":"1412.2376v2","created_at":"2026-05-18T01:22:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.2376","created_at":"2026-05-18T01:22:41Z"},{"alias_kind":"pith_short_12","alias_value":"2MEET2M62RGZ","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"2MEET2M62RGZXLQY","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"2MEET2M6","created_at":"2026-05-18T12:28:11Z"}],"graph_snapshots":[{"event_id":"sha256:69f93d5cf01687379533a3140fd87abeda8b8d41a27b6615271d948e034a4994","target":"graph","created_at":"2026-05-18T01:22:41Z","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 locating-dominating set of a graph $G$ is a dominating set $D$ of $G$ with the additional property that every two distinct vertices outside $D$ have distinct neighbors in $D$; that is, for distinct vertices $u$ and $v$ outside $D$, $N(u) \\cap D \\ne N(v) \\cap D$ where $N(u)$ denotes the open neighborhood of $u$. A graph is twin-free if every two distinct vertices have distinct open and closed neighborhoods. The location-domination number of $G$, denoted $\\gamma_L(G)$, is the minimum cardinality of a locating-dominating set in $G$. It is conjectured [D. Garijo, A. Gonz\\'alez and A. M\\'arquez. ","authors_text":"Christian L\\\"owenstein, Florent Foucaud, Michael A. Henning, Thomas Sasse","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-07T17:32:56Z","title":"Locating-dominating sets in twin-free graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.2376","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:921442dccda67661f515316962c297e0f1221e2fb97a18edfe033575a75b30f2","target":"record","created_at":"2026-05-18T01:22:41Z","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":"64ff475cf08f670e4e1ff853c224311f7a8f0374c763750ed9d3ead2beda3ba9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-07T17:32:56Z","title_canon_sha256":"473f8ef4ac8105267f692ca6f8d6023c49ec28444c2e87e44e9379c5344676a9"},"schema_version":"1.0","source":{"id":"1412.2376","kind":"arxiv","version":2}},"canonical_sha256":"d30849e99ed44d9bae18a493151da0b526617222e9c0f19b53a15a2c2e1dc557","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d30849e99ed44d9bae18a493151da0b526617222e9c0f19b53a15a2c2e1dc557","first_computed_at":"2026-05-18T01:22:41.599153Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:22:41.599153Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kj7uY8aDTTJOykwqG9BRqJyERMC6A6/qPzukcu11Z6pbWwYGtRTcdt0dCMiaNR/sfn7bOJL6972j7kPl2aQOCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:22:41.599576Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.2376","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:921442dccda67661f515316962c297e0f1221e2fb97a18edfe033575a75b30f2","sha256:69f93d5cf01687379533a3140fd87abeda8b8d41a27b6615271d948e034a4994"],"state_sha256":"c9735cb92de016114408eaa26610737307cbd664f98c3a9157fcf628b590567c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PcEyswgnYqoLgsKhRanl5POVbNytseT0arifhOONSM1sAyJBML/loE2GtRBXVhUyIccxLFvCrycME1p8Uiy8Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T06:09:18.539792Z","bundle_sha256":"6c96241b31b9447c7ade772d18fff9ddfe32d7ed6061cd2ea15bbcaf62cd685c"}}