{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:UMVUB2XPEGFEUW4BXO2SNIWGD3","short_pith_number":"pith:UMVUB2XP","canonical_record":{"source":{"id":"1306.0819","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-06-04T14:41:50Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"33e953faa3cc8392e5c2ea1c270491b76a67ca8303a4041a5448e838c4c0ec72","abstract_canon_sha256":"744da4ed81f061ec815d738cafe158278b8ff80b2da277dd8d1a98ca000b7c5a"},"schema_version":"1.0"},"canonical_sha256":"a32b40eaef218a4a5b81bbb526a2c61efc81f926aa4bb0abf2b02b76d136eb35","source":{"kind":"arxiv","id":"1306.0819","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.0819","created_at":"2026-05-18T00:53:45Z"},{"alias_kind":"arxiv_version","alias_value":"1306.0819v1","created_at":"2026-05-18T00:53:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.0819","created_at":"2026-05-18T00:53:45Z"},{"alias_kind":"pith_short_12","alias_value":"UMVUB2XPEGFE","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"UMVUB2XPEGFEUW4B","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"UMVUB2XP","created_at":"2026-05-18T12:28:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:UMVUB2XPEGFEUW4BXO2SNIWGD3","target":"record","payload":{"canonical_record":{"source":{"id":"1306.0819","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-06-04T14:41:50Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"33e953faa3cc8392e5c2ea1c270491b76a67ca8303a4041a5448e838c4c0ec72","abstract_canon_sha256":"744da4ed81f061ec815d738cafe158278b8ff80b2da277dd8d1a98ca000b7c5a"},"schema_version":"1.0"},"canonical_sha256":"a32b40eaef218a4a5b81bbb526a2c61efc81f926aa4bb0abf2b02b76d136eb35","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:45.667214Z","signature_b64":"c2g1uuxWwTyc3WUl0NDTge97g9v8zRz0j4UvHepDA6XRTCXZ8v+IIJ6u3K+RvB/9MD5rqbGfAxJIknR/sPgKAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a32b40eaef218a4a5b81bbb526a2c61efc81f926aa4bb0abf2b02b76d136eb35","last_reissued_at":"2026-05-18T00:53:45.666777Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:45.666777Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1306.0819","source_version":1,"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-18T00:53:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gyFs42MFqKZ5hjZtVVqX0j9pWnxqtjcr8/mvWNfQPOHjyxisuIqvzMOXsAM5f/x6a5UBnvp1uPsgCrNCNnmoCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T11:18:33.578162Z"},"content_sha256":"886d1be4a62cb9ed0150cca72446e96030fd6c81e22779ff5a4cd963ab0748be","schema_version":"1.0","event_id":"sha256:886d1be4a62cb9ed0150cca72446e96030fd6c81e22779ff5a4cd963ab0748be"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:UMVUB2XPEGFEUW4BXO2SNIWGD3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Random subgraphs make identification affordable","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Florent Foucaud, Guillem Perarnau, Oriol Serra","submitted_at":"2013-06-04T14:41:50Z","abstract_excerpt":"An identifying code of a graph is a dominating set which uniquely determines all the vertices by their neighborhood within the code. Whereas graphs with large minimum degree have small domination number, this is not the case for the identifying code number (the size of a smallest identifying code), which indeed is not even a monotone parameter with respect to graph inclusion.\n  We show that every graph $G$ with $n$ vertices, maximum degree $\\Delta=\\omega(1)$ and minimum degree $\\delta\\geq c\\log{\\Delta}$, for some constant $c>0$, contains a large spanning subgraph which admits an identifying co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.0819","kind":"arxiv","version":1},"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-18T00:53:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9x+FRGhlkkco/zG2c4FZbVuxfmvzGmgMfQFBtxcj67ZspShWmQMNfKF62qs1jq5viZLIyw7eMj05JuPmXxG9CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T11:18:33.578631Z"},"content_sha256":"10bf2223a1b71d230d1e590da4d142c474bb650c5f1575153ea7763e43611462","schema_version":"1.0","event_id":"sha256:10bf2223a1b71d230d1e590da4d142c474bb650c5f1575153ea7763e43611462"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UMVUB2XPEGFEUW4BXO2SNIWGD3/bundle.json","state_url":"https://pith.science/pith/UMVUB2XPEGFEUW4BXO2SNIWGD3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UMVUB2XPEGFEUW4BXO2SNIWGD3/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-06T11:18:33Z","links":{"resolver":"https://pith.science/pith/UMVUB2XPEGFEUW4BXO2SNIWGD3","bundle":"https://pith.science/pith/UMVUB2XPEGFEUW4BXO2SNIWGD3/bundle.json","state":"https://pith.science/pith/UMVUB2XPEGFEUW4BXO2SNIWGD3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UMVUB2XPEGFEUW4BXO2SNIWGD3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:UMVUB2XPEGFEUW4BXO2SNIWGD3","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":"744da4ed81f061ec815d738cafe158278b8ff80b2da277dd8d1a98ca000b7c5a","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-06-04T14:41:50Z","title_canon_sha256":"33e953faa3cc8392e5c2ea1c270491b76a67ca8303a4041a5448e838c4c0ec72"},"schema_version":"1.0","source":{"id":"1306.0819","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.0819","created_at":"2026-05-18T00:53:45Z"},{"alias_kind":"arxiv_version","alias_value":"1306.0819v1","created_at":"2026-05-18T00:53:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.0819","created_at":"2026-05-18T00:53:45Z"},{"alias_kind":"pith_short_12","alias_value":"UMVUB2XPEGFE","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"UMVUB2XPEGFEUW4B","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"UMVUB2XP","created_at":"2026-05-18T12:28:02Z"}],"graph_snapshots":[{"event_id":"sha256:10bf2223a1b71d230d1e590da4d142c474bb650c5f1575153ea7763e43611462","target":"graph","created_at":"2026-05-18T00:53:45Z","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 graph is a dominating set which uniquely determines all the vertices by their neighborhood within the code. Whereas graphs with large minimum degree have small domination number, this is not the case for the identifying code number (the size of a smallest identifying code), which indeed is not even a monotone parameter with respect to graph inclusion.\n  We show that every graph $G$ with $n$ vertices, maximum degree $\\Delta=\\omega(1)$ and minimum degree $\\delta\\geq c\\log{\\Delta}$, for some constant $c>0$, contains a large spanning subgraph which admits an identifying co","authors_text":"Florent Foucaud, Guillem Perarnau, Oriol Serra","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-06-04T14:41:50Z","title":"Random subgraphs make identification affordable"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.0819","kind":"arxiv","version":1},"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:886d1be4a62cb9ed0150cca72446e96030fd6c81e22779ff5a4cd963ab0748be","target":"record","created_at":"2026-05-18T00:53:45Z","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":"744da4ed81f061ec815d738cafe158278b8ff80b2da277dd8d1a98ca000b7c5a","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-06-04T14:41:50Z","title_canon_sha256":"33e953faa3cc8392e5c2ea1c270491b76a67ca8303a4041a5448e838c4c0ec72"},"schema_version":"1.0","source":{"id":"1306.0819","kind":"arxiv","version":1}},"canonical_sha256":"a32b40eaef218a4a5b81bbb526a2c61efc81f926aa4bb0abf2b02b76d136eb35","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a32b40eaef218a4a5b81bbb526a2c61efc81f926aa4bb0abf2b02b76d136eb35","first_computed_at":"2026-05-18T00:53:45.666777Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:53:45.666777Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"c2g1uuxWwTyc3WUl0NDTge97g9v8zRz0j4UvHepDA6XRTCXZ8v+IIJ6u3K+RvB/9MD5rqbGfAxJIknR/sPgKAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:53:45.667214Z","signed_message":"canonical_sha256_bytes"},"source_id":"1306.0819","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:886d1be4a62cb9ed0150cca72446e96030fd6c81e22779ff5a4cd963ab0748be","sha256:10bf2223a1b71d230d1e590da4d142c474bb650c5f1575153ea7763e43611462"],"state_sha256":"c22fbd29ac82b2fb6f675619d37d82e17dcbb3671a07bca85a3eea5ce8452d17"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G2w2emjmu1ULCbHTyaBwUNYLJC+k8FoRpsJMpHMjTc/KOEfU06nKnnDaxQsrUH6gJJ6G/l9fj3rm9BPg3JB4Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T11:18:33.582387Z","bundle_sha256":"15791cedf48864ad8a95fd7ed7819c52644599e00d7dee22d43357d7f6d0dda1"}}