{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:YMZA6XAB3GPYL2ERJY77FXB5EO","short_pith_number":"pith:YMZA6XAB","canonical_record":{"source":{"id":"1110.2776","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2011-10-12T18:23:36Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"62a141154c3f86ab682d1b159eff53c3bc702fa92631cc0b004d8a90580cf97c","abstract_canon_sha256":"68e7ca6ad271c804c61a248979c76e895223eff99edceac55378aa0c7c5cb1f4"},"schema_version":"1.0"},"canonical_sha256":"c3320f5c01d99f85e8914e3ff2dc3d23a4f7b96d8987509c4afc5950de9f8f89","source":{"kind":"arxiv","id":"1110.2776","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.2776","created_at":"2026-05-18T03:58:13Z"},{"alias_kind":"arxiv_version","alias_value":"1110.2776v2","created_at":"2026-05-18T03:58:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.2776","created_at":"2026-05-18T03:58:13Z"},{"alias_kind":"pith_short_12","alias_value":"YMZA6XAB3GPY","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"YMZA6XAB3GPYL2ER","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"YMZA6XAB","created_at":"2026-05-18T12:26:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:YMZA6XAB3GPYL2ERJY77FXB5EO","target":"record","payload":{"canonical_record":{"source":{"id":"1110.2776","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2011-10-12T18:23:36Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"62a141154c3f86ab682d1b159eff53c3bc702fa92631cc0b004d8a90580cf97c","abstract_canon_sha256":"68e7ca6ad271c804c61a248979c76e895223eff99edceac55378aa0c7c5cb1f4"},"schema_version":"1.0"},"canonical_sha256":"c3320f5c01d99f85e8914e3ff2dc3d23a4f7b96d8987509c4afc5950de9f8f89","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:58:13.963525Z","signature_b64":"Cr/rkSKYp4sJpQ2Ye+QU+2fiOtPux55IwrExLvPMLi+X5vJTqCKdk+qvPvP4cSrT8gykHZe59nhc6xhm+tNPCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c3320f5c01d99f85e8914e3ff2dc3d23a4f7b96d8987509c4afc5950de9f8f89","last_reissued_at":"2026-05-18T03:58:13.962999Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:58:13.962999Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1110.2776","source_version":2,"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:58:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RwfvJxRIp3I8N0czXIcoEZLGXjpx1rI18GF2i0qRxxfust+Sp3fQZ5qOxiVmOhL3Y90ZYnajSfm/HVEJKrLiAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T02:47:38.155133Z"},"content_sha256":"55d0e9cec7dede178a1af24b17d36fa6c5ff567954fab74457c1e78dda12db52","schema_version":"1.0","event_id":"sha256:55d0e9cec7dede178a1af24b17d36fa6c5ff567954fab74457c1e78dda12db52"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:YMZA6XAB3GPYL2ERJY77FXB5EO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graph Reachability and Pebble Automata over Infinite Alphabets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.FL","authors_text":"Tony Tan","submitted_at":"2011-10-12T18:23:36Z","abstract_excerpt":"Let D denote an infinite alphabet -- a set that consists of infinitely many symbols. A word w = a_0 b_0 a_1 b_1 ... a_n b_n of even length over D can be viewed as a directed graph G_w whose vertices are the symbols that appear in w, and the edges are (a_0,b_0),(a_1,b_1),...,(a_n,b_n). For a positive integer m, define a language R_m such that a word w = a_0 b_0 ... a_n b_n is in R_m if and only if there is a path in the graph G_w of length <= m from the vertex a_0 to the vertex b_n.\n  We establish the following hierarchy theorem for pebble automata over infinite alphabet. For every positive int"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.2776","kind":"arxiv","version":2},"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:58:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2bFaQh0MGLOxT+73qFyFfXR5y162NOl+XqyojftYDyWcOFYAka0eVghRbhOXUKlGTlwJk5y6eosWrreoHaotBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T02:47:38.155506Z"},"content_sha256":"58ee353dc4a57790b55a006a70e044af103fa0f4d0d16c3b75f6fd444a586233","schema_version":"1.0","event_id":"sha256:58ee353dc4a57790b55a006a70e044af103fa0f4d0d16c3b75f6fd444a586233"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YMZA6XAB3GPYL2ERJY77FXB5EO/bundle.json","state_url":"https://pith.science/pith/YMZA6XAB3GPYL2ERJY77FXB5EO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YMZA6XAB3GPYL2ERJY77FXB5EO/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-03T02:47:38Z","links":{"resolver":"https://pith.science/pith/YMZA6XAB3GPYL2ERJY77FXB5EO","bundle":"https://pith.science/pith/YMZA6XAB3GPYL2ERJY77FXB5EO/bundle.json","state":"https://pith.science/pith/YMZA6XAB3GPYL2ERJY77FXB5EO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YMZA6XAB3GPYL2ERJY77FXB5EO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:YMZA6XAB3GPYL2ERJY77FXB5EO","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":"68e7ca6ad271c804c61a248979c76e895223eff99edceac55378aa0c7c5cb1f4","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2011-10-12T18:23:36Z","title_canon_sha256":"62a141154c3f86ab682d1b159eff53c3bc702fa92631cc0b004d8a90580cf97c"},"schema_version":"1.0","source":{"id":"1110.2776","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.2776","created_at":"2026-05-18T03:58:13Z"},{"alias_kind":"arxiv_version","alias_value":"1110.2776v2","created_at":"2026-05-18T03:58:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.2776","created_at":"2026-05-18T03:58:13Z"},{"alias_kind":"pith_short_12","alias_value":"YMZA6XAB3GPY","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"YMZA6XAB3GPYL2ER","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"YMZA6XAB","created_at":"2026-05-18T12:26:47Z"}],"graph_snapshots":[{"event_id":"sha256:58ee353dc4a57790b55a006a70e044af103fa0f4d0d16c3b75f6fd444a586233","target":"graph","created_at":"2026-05-18T03:58:13Z","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":"Let D denote an infinite alphabet -- a set that consists of infinitely many symbols. A word w = a_0 b_0 a_1 b_1 ... a_n b_n of even length over D can be viewed as a directed graph G_w whose vertices are the symbols that appear in w, and the edges are (a_0,b_0),(a_1,b_1),...,(a_n,b_n). For a positive integer m, define a language R_m such that a word w = a_0 b_0 ... a_n b_n is in R_m if and only if there is a path in the graph G_w of length <= m from the vertex a_0 to the vertex b_n.\n  We establish the following hierarchy theorem for pebble automata over infinite alphabet. For every positive int","authors_text":"Tony Tan","cross_cats":["cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2011-10-12T18:23:36Z","title":"Graph Reachability and Pebble Automata over Infinite Alphabets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.2776","kind":"arxiv","version":2},"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:55d0e9cec7dede178a1af24b17d36fa6c5ff567954fab74457c1e78dda12db52","target":"record","created_at":"2026-05-18T03:58:13Z","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":"68e7ca6ad271c804c61a248979c76e895223eff99edceac55378aa0c7c5cb1f4","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2011-10-12T18:23:36Z","title_canon_sha256":"62a141154c3f86ab682d1b159eff53c3bc702fa92631cc0b004d8a90580cf97c"},"schema_version":"1.0","source":{"id":"1110.2776","kind":"arxiv","version":2}},"canonical_sha256":"c3320f5c01d99f85e8914e3ff2dc3d23a4f7b96d8987509c4afc5950de9f8f89","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c3320f5c01d99f85e8914e3ff2dc3d23a4f7b96d8987509c4afc5950de9f8f89","first_computed_at":"2026-05-18T03:58:13.962999Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:58:13.962999Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Cr/rkSKYp4sJpQ2Ye+QU+2fiOtPux55IwrExLvPMLi+X5vJTqCKdk+qvPvP4cSrT8gykHZe59nhc6xhm+tNPCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:58:13.963525Z","signed_message":"canonical_sha256_bytes"},"source_id":"1110.2776","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:55d0e9cec7dede178a1af24b17d36fa6c5ff567954fab74457c1e78dda12db52","sha256:58ee353dc4a57790b55a006a70e044af103fa0f4d0d16c3b75f6fd444a586233"],"state_sha256":"205263abf99fae9638db59638011bb74422b736d99bdae9269d55b2f7cb1996c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j2lzlMT/HaD5BBOSbW7KoL7yLFqkh3+EYsqUCmbUC/LTIvQX/u2tLfKunUjt2WmbcQE40FTH6fH6UjqYRs04Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T02:47:38.157553Z","bundle_sha256":"179e45f8920870acab3462c5780f6b6a02dfabcf6f3d20794fded4d428d06c45"}}