{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:2RSLTOEOWFLS3NUT2WGQA2JKDQ","short_pith_number":"pith:2RSLTOEO","schema_version":"1.0","canonical_sha256":"d464b9b88eb1572db693d58d00692a1c2e386555bbc63633923f720b516daa5c","source":{"kind":"arxiv","id":"1505.02224","version":1},"attestation_state":"computed","paper":{"title":"Observability of Lattice Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Fangqiu Han, Subhash Suri, Xifeng Yan","submitted_at":"2015-05-09T01:48:52Z","abstract_excerpt":"We consider a graph observability problem: how many edge colors are needed for an unlabeled graph so that an agent, walking from node to node, can uniquely determine its location from just the observed color sequence of the walk?\n  Specifically, let G(n,d) be an edge-colored subgraph of d-dimensional (directed or undirected) lattice of size n^d = n * n * ... * n. We say that G(n,d) is t-observable if an agent can uniquely determine its current position in the graph from the color sequence of any t-dimensional walk, where the dimension is the number of different directions spanned by the edges "},"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":"1505.02224","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-05-09T01:48:52Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"e0c555ff15245efaa02d73ce271b59e0ad505c7d8c9370538f165c21b2f755d2","abstract_canon_sha256":"ef3177dd9c5e9fd887b852ff09c4df99065b02640b46a0d205e50e9218dc2e8d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:16:19.530775Z","signature_b64":"tFlcueybRIog+czCAFm5urNRXjQEDOI0x6hnFgCNaUnZcfxsO2nQabtnh+0UZKCx7ppWHna8ldjfkjgH2fY/Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d464b9b88eb1572db693d58d00692a1c2e386555bbc63633923f720b516daa5c","last_reissued_at":"2026-05-18T02:16:19.530026Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:16:19.530026Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Observability of Lattice Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Fangqiu Han, Subhash Suri, Xifeng Yan","submitted_at":"2015-05-09T01:48:52Z","abstract_excerpt":"We consider a graph observability problem: how many edge colors are needed for an unlabeled graph so that an agent, walking from node to node, can uniquely determine its location from just the observed color sequence of the walk?\n  Specifically, let G(n,d) be an edge-colored subgraph of d-dimensional (directed or undirected) lattice of size n^d = n * n * ... * n. We say that G(n,d) is t-observable if an agent can uniquely determine its current position in the graph from the color sequence of any t-dimensional walk, where the dimension is the number of different directions spanned by the edges "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.02224","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":"1505.02224","created_at":"2026-05-18T02:16:19.530151+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.02224v1","created_at":"2026-05-18T02:16:19.530151+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.02224","created_at":"2026-05-18T02:16:19.530151+00:00"},{"alias_kind":"pith_short_12","alias_value":"2RSLTOEOWFLS","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_16","alias_value":"2RSLTOEOWFLS3NUT","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_8","alias_value":"2RSLTOEO","created_at":"2026-05-18T12:29:02.477457+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/2RSLTOEOWFLS3NUT2WGQA2JKDQ","json":"https://pith.science/pith/2RSLTOEOWFLS3NUT2WGQA2JKDQ.json","graph_json":"https://pith.science/api/pith-number/2RSLTOEOWFLS3NUT2WGQA2JKDQ/graph.json","events_json":"https://pith.science/api/pith-number/2RSLTOEOWFLS3NUT2WGQA2JKDQ/events.json","paper":"https://pith.science/paper/2RSLTOEO"},"agent_actions":{"view_html":"https://pith.science/pith/2RSLTOEOWFLS3NUT2WGQA2JKDQ","download_json":"https://pith.science/pith/2RSLTOEOWFLS3NUT2WGQA2JKDQ.json","view_paper":"https://pith.science/paper/2RSLTOEO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.02224&json=true","fetch_graph":"https://pith.science/api/pith-number/2RSLTOEOWFLS3NUT2WGQA2JKDQ/graph.json","fetch_events":"https://pith.science/api/pith-number/2RSLTOEOWFLS3NUT2WGQA2JKDQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2RSLTOEOWFLS3NUT2WGQA2JKDQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2RSLTOEOWFLS3NUT2WGQA2JKDQ/action/storage_attestation","attest_author":"https://pith.science/pith/2RSLTOEOWFLS3NUT2WGQA2JKDQ/action/author_attestation","sign_citation":"https://pith.science/pith/2RSLTOEOWFLS3NUT2WGQA2JKDQ/action/citation_signature","submit_replication":"https://pith.science/pith/2RSLTOEOWFLS3NUT2WGQA2JKDQ/action/replication_record"}},"created_at":"2026-05-18T02:16:19.530151+00:00","updated_at":"2026-05-18T02:16:19.530151+00:00"}