{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:2RSLTOEOWFLS3NUT2WGQA2JKDQ","short_pith_number":"pith:2RSLTOEO","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"},"canonical_sha256":"d464b9b88eb1572db693d58d00692a1c2e386555bbc63633923f720b516daa5c","source":{"kind":"arxiv","id":"1505.02224","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.02224","created_at":"2026-05-18T02:16:19Z"},{"alias_kind":"arxiv_version","alias_value":"1505.02224v1","created_at":"2026-05-18T02:16:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.02224","created_at":"2026-05-18T02:16:19Z"},{"alias_kind":"pith_short_12","alias_value":"2RSLTOEOWFLS","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"2RSLTOEOWFLS3NUT","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"2RSLTOEO","created_at":"2026-05-18T12:29:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:2RSLTOEOWFLS3NUT2WGQA2JKDQ","target":"record","payload":{"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"},"canonical_sha256":"d464b9b88eb1572db693d58d00692a1c2e386555bbc63633923f720b516daa5c","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"},"source_kind":"arxiv","source_id":"1505.02224","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-18T02:16:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uhQWMlpJgg0YNZqrVCErMCTM5/FVgkuF0bIncUHgY37LVPNYTFhewtSN8ZTMugkqqna/Q4+T/KS0k8oexwOyBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T15:32:09.030229Z"},"content_sha256":"9f1de1a777bab4da8298cd5bb828239878b44cb93df78ba7e6ecd44db76d74d2","schema_version":"1.0","event_id":"sha256:9f1de1a777bab4da8298cd5bb828239878b44cb93df78ba7e6ecd44db76d74d2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:2RSLTOEOWFLS3NUT2WGQA2JKDQ","target":"graph","payload":{"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"},"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-18T02:16:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q+mz/0E4kvAoGn1quhmGiS4bi3pS5B6G6LxDhqUBE6y27UCQWbbHMMq75Nnd9eYX0dbf5YBiB+W1N1uM9fd0BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T15:32:09.030604Z"},"content_sha256":"6626e00a3c5a31a25e7c2c2c265f67dd9a8ac7feae7b15aae64a089456d14c55","schema_version":"1.0","event_id":"sha256:6626e00a3c5a31a25e7c2c2c265f67dd9a8ac7feae7b15aae64a089456d14c55"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2RSLTOEOWFLS3NUT2WGQA2JKDQ/bundle.json","state_url":"https://pith.science/pith/2RSLTOEOWFLS3NUT2WGQA2JKDQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2RSLTOEOWFLS3NUT2WGQA2JKDQ/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-04T15:32:09Z","links":{"resolver":"https://pith.science/pith/2RSLTOEOWFLS3NUT2WGQA2JKDQ","bundle":"https://pith.science/pith/2RSLTOEOWFLS3NUT2WGQA2JKDQ/bundle.json","state":"https://pith.science/pith/2RSLTOEOWFLS3NUT2WGQA2JKDQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2RSLTOEOWFLS3NUT2WGQA2JKDQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:2RSLTOEOWFLS3NUT2WGQA2JKDQ","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":"ef3177dd9c5e9fd887b852ff09c4df99065b02640b46a0d205e50e9218dc2e8d","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-05-09T01:48:52Z","title_canon_sha256":"e0c555ff15245efaa02d73ce271b59e0ad505c7d8c9370538f165c21b2f755d2"},"schema_version":"1.0","source":{"id":"1505.02224","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.02224","created_at":"2026-05-18T02:16:19Z"},{"alias_kind":"arxiv_version","alias_value":"1505.02224v1","created_at":"2026-05-18T02:16:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.02224","created_at":"2026-05-18T02:16:19Z"},{"alias_kind":"pith_short_12","alias_value":"2RSLTOEOWFLS","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"2RSLTOEOWFLS3NUT","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"2RSLTOEO","created_at":"2026-05-18T12:29:02Z"}],"graph_snapshots":[{"event_id":"sha256:6626e00a3c5a31a25e7c2c2c265f67dd9a8ac7feae7b15aae64a089456d14c55","target":"graph","created_at":"2026-05-18T02:16:19Z","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":"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 ","authors_text":"Fangqiu Han, Subhash Suri, Xifeng Yan","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-05-09T01:48:52Z","title":"Observability of Lattice Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.02224","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:9f1de1a777bab4da8298cd5bb828239878b44cb93df78ba7e6ecd44db76d74d2","target":"record","created_at":"2026-05-18T02:16:19Z","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":"ef3177dd9c5e9fd887b852ff09c4df99065b02640b46a0d205e50e9218dc2e8d","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-05-09T01:48:52Z","title_canon_sha256":"e0c555ff15245efaa02d73ce271b59e0ad505c7d8c9370538f165c21b2f755d2"},"schema_version":"1.0","source":{"id":"1505.02224","kind":"arxiv","version":1}},"canonical_sha256":"d464b9b88eb1572db693d58d00692a1c2e386555bbc63633923f720b516daa5c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d464b9b88eb1572db693d58d00692a1c2e386555bbc63633923f720b516daa5c","first_computed_at":"2026-05-18T02:16:19.530026Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:16:19.530026Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tFlcueybRIog+czCAFm5urNRXjQEDOI0x6hnFgCNaUnZcfxsO2nQabtnh+0UZKCx7ppWHna8ldjfkjgH2fY/Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:16:19.530775Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.02224","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9f1de1a777bab4da8298cd5bb828239878b44cb93df78ba7e6ecd44db76d74d2","sha256:6626e00a3c5a31a25e7c2c2c265f67dd9a8ac7feae7b15aae64a089456d14c55"],"state_sha256":"6cc290ae660202540f5bd1e27e676ff1c407f42f352f41ffda91d1821b2044e3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x5Xq1lbDsC8RJKIH8IDy/XxroSpcLeOX8meFU+5yV4veFvnV9s35GylZcMXvSa1+wr+K+J2gd09lgMhpT+QBBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T15:32:09.032689Z","bundle_sha256":"d3a33b9e9158c1740eef58fdafd6ee2fb3b61e3d48e0557fa588cb65b9337e71"}}