{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:G2XWZFZJXZUZJY6GLQAXBCEJBI","short_pith_number":"pith:G2XWZFZJ","canonical_record":{"source":{"id":"1010.2985","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-10-14T17:29:24Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"ab8305301ede55222928bfa47e75d11460dc08cfb94e55dc88c6c6fbe421425a","abstract_canon_sha256":"23105d67a74dd461b0a2da8640b06aa077963025b791e64c935502bcef841f46"},"schema_version":"1.0"},"canonical_sha256":"36af6c9729be6994e3c65c017088890a2092483355f3df8df2af6c51e44cd8b5","source":{"kind":"arxiv","id":"1010.2985","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.2985","created_at":"2026-05-18T03:10:56Z"},{"alias_kind":"arxiv_version","alias_value":"1010.2985v3","created_at":"2026-05-18T03:10:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.2985","created_at":"2026-05-18T03:10:56Z"},{"alias_kind":"pith_short_12","alias_value":"G2XWZFZJXZUZ","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_16","alias_value":"G2XWZFZJXZUZJY6G","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_8","alias_value":"G2XWZFZJ","created_at":"2026-05-18T12:26:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:G2XWZFZJXZUZJY6GLQAXBCEJBI","target":"record","payload":{"canonical_record":{"source":{"id":"1010.2985","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-10-14T17:29:24Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"ab8305301ede55222928bfa47e75d11460dc08cfb94e55dc88c6c6fbe421425a","abstract_canon_sha256":"23105d67a74dd461b0a2da8640b06aa077963025b791e64c935502bcef841f46"},"schema_version":"1.0"},"canonical_sha256":"36af6c9729be6994e3c65c017088890a2092483355f3df8df2af6c51e44cd8b5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:10:56.119597Z","signature_b64":"gOiy3LBpye+M17Hw7uckrSEErDuqjOvH3+qAUzRDueAPiKceaqe0sPd75uUaYVowJSsCgc+/Pqn24vmCl2kHBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"36af6c9729be6994e3c65c017088890a2092483355f3df8df2af6c51e44cd8b5","last_reissued_at":"2026-05-18T03:10:56.118758Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:10:56.118758Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1010.2985","source_version":3,"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:10:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hBANkluMW7+2MIYQhyC649q48yaDXHlxQb08mTcdi8grECOfayqNU7eECh1ey/89SLpGu20uvVUZsJJYeyMPAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T07:48:34.521414Z"},"content_sha256":"bc12810db8c32bbddb763a0101062ed0e2a209ce48a14560eacfe127dfea861d","schema_version":"1.0","event_id":"sha256:bc12810db8c32bbddb763a0101062ed0e2a209ce48a14560eacfe127dfea861d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:G2XWZFZJXZUZJY6GLQAXBCEJBI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Characterizing extremal digraphs for identifying codes and extremal cases of Bondy's theorem on induced subsets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Aline Parreau (IF), Florent Foucaud (LaBRI), LRI), Reza Naserasr (LaBRI","submitted_at":"2010-10-14T17:29:24Z","abstract_excerpt":"An identifying code of a (di)graph $G$ is a dominating subset $C$ of the vertices of $G$ such that all distinct vertices of $G$ have distinct (in)neighbourhoods within $C$. In this paper, we classify all finite digraphs which only admit their whole vertex set in any identifying code. We also classify all such infinite oriented graphs. Furthermore, by relating this concept to a well known theorem of A. Bondy on set systems we classify the extremal cases for this theorem."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.2985","kind":"arxiv","version":3},"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:10:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LzVi9gdmZzt9kKldqYR2m3R8qaTZce8q3X0vFS9Ynah1OCh7luUDuX2SyY67HywCX1bO28iZXYK42tRRCtbmDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T07:48:34.521783Z"},"content_sha256":"c63e4f1611bea67a603f9123b02dfbb680ec3ca17968e4e625da2d93f391f621","schema_version":"1.0","event_id":"sha256:c63e4f1611bea67a603f9123b02dfbb680ec3ca17968e4e625da2d93f391f621"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/G2XWZFZJXZUZJY6GLQAXBCEJBI/bundle.json","state_url":"https://pith.science/pith/G2XWZFZJXZUZJY6GLQAXBCEJBI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/G2XWZFZJXZUZJY6GLQAXBCEJBI/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-03T07:48:34Z","links":{"resolver":"https://pith.science/pith/G2XWZFZJXZUZJY6GLQAXBCEJBI","bundle":"https://pith.science/pith/G2XWZFZJXZUZJY6GLQAXBCEJBI/bundle.json","state":"https://pith.science/pith/G2XWZFZJXZUZJY6GLQAXBCEJBI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/G2XWZFZJXZUZJY6GLQAXBCEJBI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:G2XWZFZJXZUZJY6GLQAXBCEJBI","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":"23105d67a74dd461b0a2da8640b06aa077963025b791e64c935502bcef841f46","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-10-14T17:29:24Z","title_canon_sha256":"ab8305301ede55222928bfa47e75d11460dc08cfb94e55dc88c6c6fbe421425a"},"schema_version":"1.0","source":{"id":"1010.2985","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.2985","created_at":"2026-05-18T03:10:56Z"},{"alias_kind":"arxiv_version","alias_value":"1010.2985v3","created_at":"2026-05-18T03:10:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.2985","created_at":"2026-05-18T03:10:56Z"},{"alias_kind":"pith_short_12","alias_value":"G2XWZFZJXZUZ","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_16","alias_value":"G2XWZFZJXZUZJY6G","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_8","alias_value":"G2XWZFZJ","created_at":"2026-05-18T12:26:07Z"}],"graph_snapshots":[{"event_id":"sha256:c63e4f1611bea67a603f9123b02dfbb680ec3ca17968e4e625da2d93f391f621","target":"graph","created_at":"2026-05-18T03:10:56Z","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":"An identifying code of a (di)graph $G$ is a dominating subset $C$ of the vertices of $G$ such that all distinct vertices of $G$ have distinct (in)neighbourhoods within $C$. In this paper, we classify all finite digraphs which only admit their whole vertex set in any identifying code. We also classify all such infinite oriented graphs. Furthermore, by relating this concept to a well known theorem of A. Bondy on set systems we classify the extremal cases for this theorem.","authors_text":"Aline Parreau (IF), Florent Foucaud (LaBRI), LRI), Reza Naserasr (LaBRI","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-10-14T17:29:24Z","title":"Characterizing extremal digraphs for identifying codes and extremal cases of Bondy's theorem on induced subsets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.2985","kind":"arxiv","version":3},"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:bc12810db8c32bbddb763a0101062ed0e2a209ce48a14560eacfe127dfea861d","target":"record","created_at":"2026-05-18T03:10:56Z","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":"23105d67a74dd461b0a2da8640b06aa077963025b791e64c935502bcef841f46","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-10-14T17:29:24Z","title_canon_sha256":"ab8305301ede55222928bfa47e75d11460dc08cfb94e55dc88c6c6fbe421425a"},"schema_version":"1.0","source":{"id":"1010.2985","kind":"arxiv","version":3}},"canonical_sha256":"36af6c9729be6994e3c65c017088890a2092483355f3df8df2af6c51e44cd8b5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"36af6c9729be6994e3c65c017088890a2092483355f3df8df2af6c51e44cd8b5","first_computed_at":"2026-05-18T03:10:56.118758Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:10:56.118758Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gOiy3LBpye+M17Hw7uckrSEErDuqjOvH3+qAUzRDueAPiKceaqe0sPd75uUaYVowJSsCgc+/Pqn24vmCl2kHBw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:10:56.119597Z","signed_message":"canonical_sha256_bytes"},"source_id":"1010.2985","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bc12810db8c32bbddb763a0101062ed0e2a209ce48a14560eacfe127dfea861d","sha256:c63e4f1611bea67a603f9123b02dfbb680ec3ca17968e4e625da2d93f391f621"],"state_sha256":"bf4881c2544edae75923ae70cc983cb1ae5dcc57f3246052bcab4b63af46d333"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8ucuS6ijVoaIqXNXhHFpuvS+0gPUzxj36uSFcZqtOVhtbbyI9Z9sMUzpQ7lFsMmDzPRmuX0YzxP59EKV0sv/AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T07:48:34.523688Z","bundle_sha256":"5ce19499468d67a7f3dde3526d93738b996b023b47ca8b893ee4a0d602d7f5e9"}}