{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:YAKK5OAKIXHM2YGTAABGHPTAOE","short_pith_number":"pith:YAKK5OAK","schema_version":"1.0","canonical_sha256":"c014aeb80a45cecd60d3000263be60713cc47ac675a9e87d0542dbfbd1170da3","source":{"kind":"arxiv","id":"1605.03141","version":4},"attestation_state":"computed","paper":{"title":"Error-correcting codes from $k$-resolving sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ismael G. Yero, Robert F. Bailey","submitted_at":"2016-05-10T18:24:35Z","abstract_excerpt":"We demonstrate a construction of error-correcting codes from graphs by means of $k$-resolving sets, and present a decoding algorithm which makes use of covering designs. Along the way, we determine the $k$-metric dimension of grid graphs (i.e. Cartesian products of paths)."},"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":"1605.03141","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-10T18:24:35Z","cross_cats_sorted":[],"title_canon_sha256":"185c2c03357c9cf69a0df64aff26fad2db104d298a22f19108e1b283d205f077","abstract_canon_sha256":"ed37bfd4c467dfb18cf560b25f06c0ac69caf55bc42b7b4547374e02c0d287db"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:41.374251Z","signature_b64":"h8uXMrCGHFSlsbABa1LreVmxEIsgv69tK+D55jaHKTFA/J3/qt1Cjl2SvHlUO0buR7eP0wAjMXsSHbPdHH3qAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c014aeb80a45cecd60d3000263be60713cc47ac675a9e87d0542dbfbd1170da3","last_reissued_at":"2026-05-18T00:36:41.373602Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:41.373602Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Error-correcting codes from $k$-resolving sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ismael G. Yero, Robert F. Bailey","submitted_at":"2016-05-10T18:24:35Z","abstract_excerpt":"We demonstrate a construction of error-correcting codes from graphs by means of $k$-resolving sets, and present a decoding algorithm which makes use of covering designs. Along the way, we determine the $k$-metric dimension of grid graphs (i.e. Cartesian products of paths)."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.03141","kind":"arxiv","version":4},"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":"1605.03141","created_at":"2026-05-18T00:36:41.373701+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.03141v4","created_at":"2026-05-18T00:36:41.373701+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.03141","created_at":"2026-05-18T00:36:41.373701+00:00"},{"alias_kind":"pith_short_12","alias_value":"YAKK5OAKIXHM","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_16","alias_value":"YAKK5OAKIXHM2YGT","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_8","alias_value":"YAKK5OAK","created_at":"2026-05-18T12:30:53.716459+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/YAKK5OAKIXHM2YGTAABGHPTAOE","json":"https://pith.science/pith/YAKK5OAKIXHM2YGTAABGHPTAOE.json","graph_json":"https://pith.science/api/pith-number/YAKK5OAKIXHM2YGTAABGHPTAOE/graph.json","events_json":"https://pith.science/api/pith-number/YAKK5OAKIXHM2YGTAABGHPTAOE/events.json","paper":"https://pith.science/paper/YAKK5OAK"},"agent_actions":{"view_html":"https://pith.science/pith/YAKK5OAKIXHM2YGTAABGHPTAOE","download_json":"https://pith.science/pith/YAKK5OAKIXHM2YGTAABGHPTAOE.json","view_paper":"https://pith.science/paper/YAKK5OAK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.03141&json=true","fetch_graph":"https://pith.science/api/pith-number/YAKK5OAKIXHM2YGTAABGHPTAOE/graph.json","fetch_events":"https://pith.science/api/pith-number/YAKK5OAKIXHM2YGTAABGHPTAOE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YAKK5OAKIXHM2YGTAABGHPTAOE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YAKK5OAKIXHM2YGTAABGHPTAOE/action/storage_attestation","attest_author":"https://pith.science/pith/YAKK5OAKIXHM2YGTAABGHPTAOE/action/author_attestation","sign_citation":"https://pith.science/pith/YAKK5OAKIXHM2YGTAABGHPTAOE/action/citation_signature","submit_replication":"https://pith.science/pith/YAKK5OAKIXHM2YGTAABGHPTAOE/action/replication_record"}},"created_at":"2026-05-18T00:36:41.373701+00:00","updated_at":"2026-05-18T00:36:41.373701+00:00"}