{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:ESDZJT6U55FGXQ677NKQKJHLH6","short_pith_number":"pith:ESDZJT6U","canonical_record":{"source":{"id":"1103.3756","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-03-19T06:20:28Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"f77671122ba5e0e8f050011d2fef7394a34670e70e7fdd4907419ea75ded83d7","abstract_canon_sha256":"9a8027487794bc013dbf921283c36c6e8a8a1bda47f031752c85301bf64b3d97"},"schema_version":"1.0"},"canonical_sha256":"248794cfd4ef4a6bc3dffb550524eb3fa4d33956c64b44ff7157e70b8f4f5c06","source":{"kind":"arxiv","id":"1103.3756","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.3756","created_at":"2026-05-18T03:45:10Z"},{"alias_kind":"arxiv_version","alias_value":"1103.3756v5","created_at":"2026-05-18T03:45:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.3756","created_at":"2026-05-18T03:45:10Z"},{"alias_kind":"pith_short_12","alias_value":"ESDZJT6U55FG","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"ESDZJT6U55FGXQ67","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"ESDZJT6U","created_at":"2026-05-18T12:26:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:ESDZJT6U55FGXQ677NKQKJHLH6","target":"record","payload":{"canonical_record":{"source":{"id":"1103.3756","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-03-19T06:20:28Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"f77671122ba5e0e8f050011d2fef7394a34670e70e7fdd4907419ea75ded83d7","abstract_canon_sha256":"9a8027487794bc013dbf921283c36c6e8a8a1bda47f031752c85301bf64b3d97"},"schema_version":"1.0"},"canonical_sha256":"248794cfd4ef4a6bc3dffb550524eb3fa4d33956c64b44ff7157e70b8f4f5c06","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:45:10.871137Z","signature_b64":"v+ILgSfeVK5lwjeJCQGmfF8kQfXUjXZWLZe6M0OGpKZrIYc490mToQ/anTYfpsvZhdPVYAv2nazse3rt8JxcBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"248794cfd4ef4a6bc3dffb550524eb3fa4d33956c64b44ff7157e70b8f4f5c06","last_reissued_at":"2026-05-18T03:45:10.870338Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:45:10.870338Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1103.3756","source_version":5,"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:45:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DnFK7D2+3HPmG5kAr/tnvmaWEhTQLFpcV1ikJDyM1MpFh6LsxQOYeot4w6l5G+hNly0u8z6+9qb6Zr3Xc3JzDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T02:07:02.915838Z"},"content_sha256":"9b2b6bcce3acfca7cb9b0ce46049bdc7a6b1a274080f45dc37053681221e5415","schema_version":"1.0","event_id":"sha256:9b2b6bcce3acfca7cb9b0ce46049bdc7a6b1a274080f45dc37053681221e5415"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:ESDZJT6U55FGXQ677NKQKJHLH6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bounds for identifying codes in terms of degree parameters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Florent Foucaud (LaBRI), Guillem Perarnau (UPC)","submitted_at":"2011-03-19T06:20:28Z","abstract_excerpt":"An identifying code is a subset of vertices of a graph such that each vertex is uniquely determined by its neighbourhood within the identifying code. If $\\M(G)$ denotes the minimum size of an identifying code of a graph $G$, it was conjectured by F. Foucaud, R. Klasing, A. Kosowski and A. Raspaud that there exists a constant $c$ such that if a connected graph $G$ with $n$ vertices and maximum degree $d$ admits an identifying code, then $\\M(G)\\leq n-\\tfrac{n}{d}+c$. We use probabilistic tools to show that for any $d\\geq 3$, $\\M(G)\\leq n-\\tfrac{n}{\\Theta(d)}$ holds for a large class of graphs co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.3756","kind":"arxiv","version":5},"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:45:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Feq/px+YNVZfK05O79DSbrvKTQljAkoS12vAxqpolxMElC1uP5QY/wHpuoEdLL+mLU/4xT2tY7Km9oJxfgZ6BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T02:07:02.916584Z"},"content_sha256":"8fee8a99052141e7c4715cd446dccc9a30e568d94d38327bec5fcb19ebc3c73f","schema_version":"1.0","event_id":"sha256:8fee8a99052141e7c4715cd446dccc9a30e568d94d38327bec5fcb19ebc3c73f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ESDZJT6U55FGXQ677NKQKJHLH6/bundle.json","state_url":"https://pith.science/pith/ESDZJT6U55FGXQ677NKQKJHLH6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ESDZJT6U55FGXQ677NKQKJHLH6/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-05T02:07:02Z","links":{"resolver":"https://pith.science/pith/ESDZJT6U55FGXQ677NKQKJHLH6","bundle":"https://pith.science/pith/ESDZJT6U55FGXQ677NKQKJHLH6/bundle.json","state":"https://pith.science/pith/ESDZJT6U55FGXQ677NKQKJHLH6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ESDZJT6U55FGXQ677NKQKJHLH6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:ESDZJT6U55FGXQ677NKQKJHLH6","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":"9a8027487794bc013dbf921283c36c6e8a8a1bda47f031752c85301bf64b3d97","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-03-19T06:20:28Z","title_canon_sha256":"f77671122ba5e0e8f050011d2fef7394a34670e70e7fdd4907419ea75ded83d7"},"schema_version":"1.0","source":{"id":"1103.3756","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.3756","created_at":"2026-05-18T03:45:10Z"},{"alias_kind":"arxiv_version","alias_value":"1103.3756v5","created_at":"2026-05-18T03:45:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.3756","created_at":"2026-05-18T03:45:10Z"},{"alias_kind":"pith_short_12","alias_value":"ESDZJT6U55FG","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"ESDZJT6U55FGXQ67","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"ESDZJT6U","created_at":"2026-05-18T12:26:28Z"}],"graph_snapshots":[{"event_id":"sha256:8fee8a99052141e7c4715cd446dccc9a30e568d94d38327bec5fcb19ebc3c73f","target":"graph","created_at":"2026-05-18T03:45:10Z","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 is a subset of vertices of a graph such that each vertex is uniquely determined by its neighbourhood within the identifying code. If $\\M(G)$ denotes the minimum size of an identifying code of a graph $G$, it was conjectured by F. Foucaud, R. Klasing, A. Kosowski and A. Raspaud that there exists a constant $c$ such that if a connected graph $G$ with $n$ vertices and maximum degree $d$ admits an identifying code, then $\\M(G)\\leq n-\\tfrac{n}{d}+c$. We use probabilistic tools to show that for any $d\\geq 3$, $\\M(G)\\leq n-\\tfrac{n}{\\Theta(d)}$ holds for a large class of graphs co","authors_text":"Florent Foucaud (LaBRI), Guillem Perarnau (UPC)","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-03-19T06:20:28Z","title":"Bounds for identifying codes in terms of degree parameters"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.3756","kind":"arxiv","version":5},"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:9b2b6bcce3acfca7cb9b0ce46049bdc7a6b1a274080f45dc37053681221e5415","target":"record","created_at":"2026-05-18T03:45:10Z","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":"9a8027487794bc013dbf921283c36c6e8a8a1bda47f031752c85301bf64b3d97","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-03-19T06:20:28Z","title_canon_sha256":"f77671122ba5e0e8f050011d2fef7394a34670e70e7fdd4907419ea75ded83d7"},"schema_version":"1.0","source":{"id":"1103.3756","kind":"arxiv","version":5}},"canonical_sha256":"248794cfd4ef4a6bc3dffb550524eb3fa4d33956c64b44ff7157e70b8f4f5c06","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"248794cfd4ef4a6bc3dffb550524eb3fa4d33956c64b44ff7157e70b8f4f5c06","first_computed_at":"2026-05-18T03:45:10.870338Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:45:10.870338Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"v+ILgSfeVK5lwjeJCQGmfF8kQfXUjXZWLZe6M0OGpKZrIYc490mToQ/anTYfpsvZhdPVYAv2nazse3rt8JxcBA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:45:10.871137Z","signed_message":"canonical_sha256_bytes"},"source_id":"1103.3756","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9b2b6bcce3acfca7cb9b0ce46049bdc7a6b1a274080f45dc37053681221e5415","sha256:8fee8a99052141e7c4715cd446dccc9a30e568d94d38327bec5fcb19ebc3c73f"],"state_sha256":"48d38315c227eebd1ef55d28e6be00ad8824c53afd5bd20709cbfd8b702a6113"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tr4KK3yycEkFkIkqVHf8+x/nj8xkbUD7WibrshyrrlM0RYnJOXBe3o4jOcY0e5ND9G6bufsjtTq1CL1U/VvfDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T02:07:02.920920Z","bundle_sha256":"806a63d7299471a812fb293f8a4f5ef3195f971dac2324e5b96c14b75e7b1a0f"}}