{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:UCQIC54W5U5IWZLSZUDN3QUA66","short_pith_number":"pith:UCQIC54W","canonical_record":{"source":{"id":"1811.04803","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-09T15:12:24Z","cross_cats_sorted":["math.CO","stat.ML"],"title_canon_sha256":"9cd41482bac57f716fe11b1dbbb4e4431dc2a0224badb83c6c245891c1e4297e","abstract_canon_sha256":"dd4e14bb6e980e80284ac7a33a807d37e17df6bf8a4fe78cd0c2fd5b68bacf6d"},"schema_version":"1.0"},"canonical_sha256":"a0a0817796ed3a8b6572cd06ddc280f7ba63322e6bbbe9cd2e52f80cee6624a5","source":{"kind":"arxiv","id":"1811.04803","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.04803","created_at":"2026-07-05T00:26:23Z"},{"alias_kind":"arxiv_version","alias_value":"1811.04803v2","created_at":"2026-07-05T00:26:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.04803","created_at":"2026-07-05T00:26:23Z"},{"alias_kind":"pith_short_12","alias_value":"UCQIC54W5U5I","created_at":"2026-07-05T00:26:23Z"},{"alias_kind":"pith_short_16","alias_value":"UCQIC54W5U5IWZLS","created_at":"2026-07-05T00:26:23Z"},{"alias_kind":"pith_short_8","alias_value":"UCQIC54W","created_at":"2026-07-05T00:26:23Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:UCQIC54W5U5IWZLSZUDN3QUA66","target":"record","payload":{"canonical_record":{"source":{"id":"1811.04803","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-09T15:12:24Z","cross_cats_sorted":["math.CO","stat.ML"],"title_canon_sha256":"9cd41482bac57f716fe11b1dbbb4e4431dc2a0224badb83c6c245891c1e4297e","abstract_canon_sha256":"dd4e14bb6e980e80284ac7a33a807d37e17df6bf8a4fe78cd0c2fd5b68bacf6d"},"schema_version":"1.0"},"canonical_sha256":"a0a0817796ed3a8b6572cd06ddc280f7ba63322e6bbbe9cd2e52f80cee6624a5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:26:23.389802Z","signature_b64":"kGlk28uCg4HqMc8FZ7Gpd9jcOXjnK7zXLNcHxWuqfJC6nos4z5RyGqGA2CKkFNvNxsAcnkLWjCiYfj5KeUcSBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a0a0817796ed3a8b6572cd06ddc280f7ba63322e6bbbe9cd2e52f80cee6624a5","last_reissued_at":"2026-07-05T00:26:23.389400Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:26:23.389400Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.04803","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-07-05T00:26:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8Gj6xgqr/M4fOwfSfo2eMGDCP4JtkzIF23dOeXz7QdkLzC2IpEM3UwUcJpYYLCfJcJVAqJplTOH4VW2OygWiAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-08T02:54:52.830969Z"},"content_sha256":"8586b436e09eeeaee0b629a3e19eace82b920b691e7eb7c3380a9794144a7242","schema_version":"1.0","event_id":"sha256:8586b436e09eeeaee0b629a3e19eace82b920b691e7eb7c3380a9794144a7242"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:UCQIC54W5U5IWZLSZUDN3QUA66","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Observability Properties of Colored Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","stat.ML"],"primary_cat":"cs.LG","authors_text":"George Cybenko, Gil Raz, Isaac Dekine, Mark Chilenski, Piyush Kumar","submitted_at":"2018-11-09T15:12:24Z","abstract_excerpt":"A colored graph is a directed graph in which nodes or edges have been assigned colors that are not necessarily unique. Observability problems in such graphs consider whether an agent observing the colors of edges or nodes traversed on a path in the graph can determine which node they are at currently or which nodes were visited earlier in the traversal. Previous research efforts have identified several different notions of observability as well as the associated properties of graphs for which those observability properties hold. This paper unifies the prior work into a common framework with se"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.04803","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1811.04803/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T00:26:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CFnb+hnon2fAsZn17Q0gY9cE+P2bK0kOzK2a9yIntwpKYXg7BDwcFOdyISijgWbitP/9eH9Q1vOHn8K+YR0JCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-08T02:54:52.831348Z"},"content_sha256":"06889df442e632b51dcaead9d4e55a0c359d1a28126f38ca03bfe44244d6a1ad","schema_version":"1.0","event_id":"sha256:06889df442e632b51dcaead9d4e55a0c359d1a28126f38ca03bfe44244d6a1ad"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UCQIC54W5U5IWZLSZUDN3QUA66/bundle.json","state_url":"https://pith.science/pith/UCQIC54W5U5IWZLSZUDN3QUA66/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UCQIC54W5U5IWZLSZUDN3QUA66/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-07-08T02:54:52Z","links":{"resolver":"https://pith.science/pith/UCQIC54W5U5IWZLSZUDN3QUA66","bundle":"https://pith.science/pith/UCQIC54W5U5IWZLSZUDN3QUA66/bundle.json","state":"https://pith.science/pith/UCQIC54W5U5IWZLSZUDN3QUA66/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UCQIC54W5U5IWZLSZUDN3QUA66/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:UCQIC54W5U5IWZLSZUDN3QUA66","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":"dd4e14bb6e980e80284ac7a33a807d37e17df6bf8a4fe78cd0c2fd5b68bacf6d","cross_cats_sorted":["math.CO","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-09T15:12:24Z","title_canon_sha256":"9cd41482bac57f716fe11b1dbbb4e4431dc2a0224badb83c6c245891c1e4297e"},"schema_version":"1.0","source":{"id":"1811.04803","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.04803","created_at":"2026-07-05T00:26:23Z"},{"alias_kind":"arxiv_version","alias_value":"1811.04803v2","created_at":"2026-07-05T00:26:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.04803","created_at":"2026-07-05T00:26:23Z"},{"alias_kind":"pith_short_12","alias_value":"UCQIC54W5U5I","created_at":"2026-07-05T00:26:23Z"},{"alias_kind":"pith_short_16","alias_value":"UCQIC54W5U5IWZLS","created_at":"2026-07-05T00:26:23Z"},{"alias_kind":"pith_short_8","alias_value":"UCQIC54W","created_at":"2026-07-05T00:26:23Z"}],"graph_snapshots":[{"event_id":"sha256:06889df442e632b51dcaead9d4e55a0c359d1a28126f38ca03bfe44244d6a1ad","target":"graph","created_at":"2026-07-05T00:26:23Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1811.04803/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A colored graph is a directed graph in which nodes or edges have been assigned colors that are not necessarily unique. Observability problems in such graphs consider whether an agent observing the colors of edges or nodes traversed on a path in the graph can determine which node they are at currently or which nodes were visited earlier in the traversal. Previous research efforts have identified several different notions of observability as well as the associated properties of graphs for which those observability properties hold. This paper unifies the prior work into a common framework with se","authors_text":"George Cybenko, Gil Raz, Isaac Dekine, Mark Chilenski, Piyush Kumar","cross_cats":["math.CO","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-09T15:12:24Z","title":"Observability Properties of Colored Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.04803","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:8586b436e09eeeaee0b629a3e19eace82b920b691e7eb7c3380a9794144a7242","target":"record","created_at":"2026-07-05T00:26:23Z","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":"dd4e14bb6e980e80284ac7a33a807d37e17df6bf8a4fe78cd0c2fd5b68bacf6d","cross_cats_sorted":["math.CO","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-09T15:12:24Z","title_canon_sha256":"9cd41482bac57f716fe11b1dbbb4e4431dc2a0224badb83c6c245891c1e4297e"},"schema_version":"1.0","source":{"id":"1811.04803","kind":"arxiv","version":2}},"canonical_sha256":"a0a0817796ed3a8b6572cd06ddc280f7ba63322e6bbbe9cd2e52f80cee6624a5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a0a0817796ed3a8b6572cd06ddc280f7ba63322e6bbbe9cd2e52f80cee6624a5","first_computed_at":"2026-07-05T00:26:23.389400Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:26:23.389400Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kGlk28uCg4HqMc8FZ7Gpd9jcOXjnK7zXLNcHxWuqfJC6nos4z5RyGqGA2CKkFNvNxsAcnkLWjCiYfj5KeUcSBg==","signature_status":"signed_v1","signed_at":"2026-07-05T00:26:23.389802Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.04803","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8586b436e09eeeaee0b629a3e19eace82b920b691e7eb7c3380a9794144a7242","sha256:06889df442e632b51dcaead9d4e55a0c359d1a28126f38ca03bfe44244d6a1ad"],"state_sha256":"662b53c25babcb4c53eca6abadb76d8248022a41bc72b781851eb97fc90fd5f2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2vUEdRLBQIgaU6P4O43n/ysUFyA+hjbYN55hNz/5hgj+PDvnDNKVcLWc8TxpXAiW0RFl1a4yseupUr8q6QGeCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-08T02:54:52.833335Z","bundle_sha256":"10ab2d203ad255f6bad10861a1714bf248c4c5b395e6bffb1bb033e73c3b427c"}}