{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:UMVUB2XPEGFEUW4BXO2SNIWGD3","short_pith_number":"pith:UMVUB2XP","schema_version":"1.0","canonical_sha256":"a32b40eaef218a4a5b81bbb526a2c61efc81f926aa4bb0abf2b02b76d136eb35","source":{"kind":"arxiv","id":"1306.0819","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1306.0819","created_at":"2026-05-18T00:53:45.666844+00:00"},{"alias_kind":"arxiv_version","alias_value":"1306.0819v1","created_at":"2026-05-18T00:53:45.666844+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.0819","created_at":"2026-05-18T00:53:45.666844+00:00"},{"alias_kind":"pith_short_12","alias_value":"UMVUB2XPEGFE","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_16","alias_value":"UMVUB2XPEGFEUW4B","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_8","alias_value":"UMVUB2XP","created_at":"2026-05-18T12:28:02.375192+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UMVUB2XPEGFEUW4BXO2SNIWGD3","json":"https://pith.science/pith/UMVUB2XPEGFEUW4BXO2SNIWGD3.json","graph_json":"https://pith.science/api/pith-number/UMVUB2XPEGFEUW4BXO2SNIWGD3/graph.json","events_json":"https://pith.science/api/pith-number/UMVUB2XPEGFEUW4BXO2SNIWGD3/events.json","paper":"https://pith.science/paper/UMVUB2XP"},"agent_actions":{"view_html":"https://pith.science/pith/UMVUB2XPEGFEUW4BXO2SNIWGD3","download_json":"https://pith.science/pith/UMVUB2XPEGFEUW4BXO2SNIWGD3.json","view_paper":"https://pith.science/paper/UMVUB2XP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1306.0819&json=true","fetch_graph":"https://pith.science/api/pith-number/UMVUB2XPEGFEUW4BXO2SNIWGD3/graph.json","fetch_events":"https://pith.science/api/pith-number/UMVUB2XPEGFEUW4BXO2SNIWGD3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UMVUB2XPEGFEUW4BXO2SNIWGD3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UMVUB2XPEGFEUW4BXO2SNIWGD3/action/storage_attestation","attest_author":"https://pith.science/pith/UMVUB2XPEGFEUW4BXO2SNIWGD3/action/author_attestation","sign_citation":"https://pith.science/pith/UMVUB2XPEGFEUW4BXO2SNIWGD3/action/citation_signature","submit_replication":"https://pith.science/pith/UMVUB2XPEGFEUW4BXO2SNIWGD3/action/replication_record"}},"created_at":"2026-05-18T00:53:45.666844+00:00","updated_at":"2026-05-18T00:53:45.666844+00:00"}