{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:RG6KVEF6ZTBC6KZFHRTJHA4QL5","short_pith_number":"pith:RG6KVEF6","canonical_record":{"source":{"id":"1506.02623","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-06-08T19:19:57Z","cross_cats_sorted":[],"title_canon_sha256":"a1c0b689e5c82999565f401af5f1881498fc336480f62e0dbf719a0db367ef56","abstract_canon_sha256":"1fcb105ae336986d7fe08bc34dcc77680203908b6bb92b29570f38ab61969dbe"},"schema_version":"1.0"},"canonical_sha256":"89bcaa90beccc22f2b253c669383905f5a32cd18b0610c909267c003cfac4254","source":{"kind":"arxiv","id":"1506.02623","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.02623","created_at":"2026-05-18T01:09:29Z"},{"alias_kind":"arxiv_version","alias_value":"1506.02623v2","created_at":"2026-05-18T01:09:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.02623","created_at":"2026-05-18T01:09:29Z"},{"alias_kind":"pith_short_12","alias_value":"RG6KVEF6ZTBC","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"RG6KVEF6ZTBC6KZF","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"RG6KVEF6","created_at":"2026-05-18T12:29:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:RG6KVEF6ZTBC6KZFHRTJHA4QL5","target":"record","payload":{"canonical_record":{"source":{"id":"1506.02623","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-06-08T19:19:57Z","cross_cats_sorted":[],"title_canon_sha256":"a1c0b689e5c82999565f401af5f1881498fc336480f62e0dbf719a0db367ef56","abstract_canon_sha256":"1fcb105ae336986d7fe08bc34dcc77680203908b6bb92b29570f38ab61969dbe"},"schema_version":"1.0"},"canonical_sha256":"89bcaa90beccc22f2b253c669383905f5a32cd18b0610c909267c003cfac4254","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:29.795776Z","signature_b64":"F0/bojev+YwDe39pS+AM/3QWkfo72XplYKyQLQG83x21MJxBGgph5NtZoikvWwIu1fRX1Zvyu29qqjlKiiHhCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"89bcaa90beccc22f2b253c669383905f5a32cd18b0610c909267c003cfac4254","last_reissued_at":"2026-05-18T01:09:29.795381Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:29.795381Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.02623","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:09:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JREUud0t/SFGmkQzBuWfC/rDRra3BslqMeNQL1gZeTJQMECyVtY0CTtjtsDu2uTS55A83Bb/VWKIj4SjlQ8dAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T06:17:07.760425Z"},"content_sha256":"4a536222dba647859ef0ee12b885ba98a270ffc1e16bae303ce587e68eaaaf61","schema_version":"1.0","event_id":"sha256:4a536222dba647859ef0ee12b885ba98a270ffc1e16bae303ce587e68eaaaf61"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:RG6KVEF6ZTBC6KZFHRTJHA4QL5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Location-domination in line graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Florent Foucaud, Michael A. Henning","submitted_at":"2015-06-08T19:19:57Z","abstract_excerpt":"A set $D$ of vertices of a graph $G$ is locating if 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 \\neq N(v) \\cap D$, where $N(u)$ denotes the open neighborhood of $u$. If $D$ is also a dominating set (total dominating set), it is called a locating-dominating set (respectively, locating-total dominating set) of $G$. A graph $G$ is twin-free if every two distinct vertices of $G$ have distinct open and closed neighborhoods. It is conjectured [D. Garijo, A. Gonzalez and A. Marquez, The difference between"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.02623","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:09:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ceetTuKlkQqJObuiJ1uy+FYjMCO9+HQ1S8nskzWLYJLSd364SSQ4GffjPYwTQ4sbhd0YOGV06njNEr2KBrTmDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T06:17:07.761140Z"},"content_sha256":"f5faf449f0d40023b31ffd9dc1a7def4024ea0817fd98410b6fe4af8c8546090","schema_version":"1.0","event_id":"sha256:f5faf449f0d40023b31ffd9dc1a7def4024ea0817fd98410b6fe4af8c8546090"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RG6KVEF6ZTBC6KZFHRTJHA4QL5/bundle.json","state_url":"https://pith.science/pith/RG6KVEF6ZTBC6KZFHRTJHA4QL5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RG6KVEF6ZTBC6KZFHRTJHA4QL5/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-11T06:17:07Z","links":{"resolver":"https://pith.science/pith/RG6KVEF6ZTBC6KZFHRTJHA4QL5","bundle":"https://pith.science/pith/RG6KVEF6ZTBC6KZFHRTJHA4QL5/bundle.json","state":"https://pith.science/pith/RG6KVEF6ZTBC6KZFHRTJHA4QL5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RG6KVEF6ZTBC6KZFHRTJHA4QL5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:RG6KVEF6ZTBC6KZFHRTJHA4QL5","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":"1fcb105ae336986d7fe08bc34dcc77680203908b6bb92b29570f38ab61969dbe","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-06-08T19:19:57Z","title_canon_sha256":"a1c0b689e5c82999565f401af5f1881498fc336480f62e0dbf719a0db367ef56"},"schema_version":"1.0","source":{"id":"1506.02623","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.02623","created_at":"2026-05-18T01:09:29Z"},{"alias_kind":"arxiv_version","alias_value":"1506.02623v2","created_at":"2026-05-18T01:09:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.02623","created_at":"2026-05-18T01:09:29Z"},{"alias_kind":"pith_short_12","alias_value":"RG6KVEF6ZTBC","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"RG6KVEF6ZTBC6KZF","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"RG6KVEF6","created_at":"2026-05-18T12:29:39Z"}],"graph_snapshots":[{"event_id":"sha256:f5faf449f0d40023b31ffd9dc1a7def4024ea0817fd98410b6fe4af8c8546090","target":"graph","created_at":"2026-05-18T01:09:29Z","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 set $D$ of vertices of a graph $G$ is locating if 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 \\neq N(v) \\cap D$, where $N(u)$ denotes the open neighborhood of $u$. If $D$ is also a dominating set (total dominating set), it is called a locating-dominating set (respectively, locating-total dominating set) of $G$. A graph $G$ is twin-free if every two distinct vertices of $G$ have distinct open and closed neighborhoods. It is conjectured [D. Garijo, A. Gonzalez and A. Marquez, The difference between","authors_text":"Florent Foucaud, Michael A. Henning","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-06-08T19:19:57Z","title":"Location-domination in line graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.02623","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:4a536222dba647859ef0ee12b885ba98a270ffc1e16bae303ce587e68eaaaf61","target":"record","created_at":"2026-05-18T01:09:29Z","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":"1fcb105ae336986d7fe08bc34dcc77680203908b6bb92b29570f38ab61969dbe","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-06-08T19:19:57Z","title_canon_sha256":"a1c0b689e5c82999565f401af5f1881498fc336480f62e0dbf719a0db367ef56"},"schema_version":"1.0","source":{"id":"1506.02623","kind":"arxiv","version":2}},"canonical_sha256":"89bcaa90beccc22f2b253c669383905f5a32cd18b0610c909267c003cfac4254","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"89bcaa90beccc22f2b253c669383905f5a32cd18b0610c909267c003cfac4254","first_computed_at":"2026-05-18T01:09:29.795381Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:09:29.795381Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"F0/bojev+YwDe39pS+AM/3QWkfo72XplYKyQLQG83x21MJxBGgph5NtZoikvWwIu1fRX1Zvyu29qqjlKiiHhCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:09:29.795776Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.02623","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4a536222dba647859ef0ee12b885ba98a270ffc1e16bae303ce587e68eaaaf61","sha256:f5faf449f0d40023b31ffd9dc1a7def4024ea0817fd98410b6fe4af8c8546090"],"state_sha256":"91d472ac881d81470a5fd6e911d73423f6a2cdc3297311fedbcc038d2aafe79d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LMCClujuyTJDsixrYk3nnPAdseWe+JipNwtEvRPbVOKUawvb4hn0xrdpTcOZbRgorkrbLNTxisbGjz8pF7qbAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T06:17:07.764963Z","bundle_sha256":"ea0e2ef781f1ee2f6f6576725ad90faf4499b9d7db2d16991e5fab759f160742"}}