{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:XE27YMHNR46GA5UZ2ZPS4M7BON","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":"7b64c0e0ca26e2339a6daacbb28a8b25b513560e8dec15dbf3bfc18e3754cff8","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-02-11T11:58:37Z","title_canon_sha256":"33c9db543f29314a6bf4a7122b377cd9136bd6dc23b42da11a10a5831adafbba"},"schema_version":"1.0","source":{"id":"2502.07496","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.07496","created_at":"2026-07-05T10:12:38Z"},{"alias_kind":"arxiv_version","alias_value":"2502.07496v1","created_at":"2026-07-05T10:12:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.07496","created_at":"2026-07-05T10:12:38Z"},{"alias_kind":"pith_short_12","alias_value":"XE27YMHNR46G","created_at":"2026-07-05T10:12:38Z"},{"alias_kind":"pith_short_16","alias_value":"XE27YMHNR46GA5UZ","created_at":"2026-07-05T10:12:38Z"},{"alias_kind":"pith_short_8","alias_value":"XE27YMHN","created_at":"2026-07-05T10:12:38Z"}],"graph_snapshots":[{"event_id":"sha256:7602d2bd7fcf6c0a61ac3170bae94dcac3c6c07aff4f88a5a599352f48fc0427","target":"graph","created_at":"2026-07-05T10:12:38Z","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/2502.07496/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Word-representable graphs are a subset of graphs that may be represented by a word $w$ over an alphabet composed of the vertices in the graph. In such graphs, an edge exists if and only if the occurrences of the corresponding vertices alternate in the word $w$. We generalise this notion to temporal graphs, constructing timesteps by partitioning the word into factors (contiguous subwords) such that no factor contains more than one copy of any given symbol. With this definition, we study the problem of \\emph{exploration}, asking for the fastest schedule such that a given agent may explore all $n","authors_text":"Duncan Adamson","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-02-11T11:58:37Z","title":"Exploring Word-Representable Temporal Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.07496","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:7136aa6f72847d1ec498eb1207f96a474e7bc3112439543ffe556608a0faf2d9","target":"record","created_at":"2026-07-05T10:12:38Z","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":"7b64c0e0ca26e2339a6daacbb28a8b25b513560e8dec15dbf3bfc18e3754cff8","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-02-11T11:58:37Z","title_canon_sha256":"33c9db543f29314a6bf4a7122b377cd9136bd6dc23b42da11a10a5831adafbba"},"schema_version":"1.0","source":{"id":"2502.07496","kind":"arxiv","version":1}},"canonical_sha256":"b935fc30ed8f3c607699d65f2e33e1736697d80438e21ee83855511921147eec","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b935fc30ed8f3c607699d65f2e33e1736697d80438e21ee83855511921147eec","first_computed_at":"2026-07-05T10:12:38.349302Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:12:38.349302Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xPq11mR8sbnkBFgQmjHn0O+MDBq+SRD2+8QhwU94E/WELgE4GjVMcEWnRvNg+PkgNNRxw1eQjgujeOGFzXOKDw==","signature_status":"signed_v1","signed_at":"2026-07-05T10:12:38.349728Z","signed_message":"canonical_sha256_bytes"},"source_id":"2502.07496","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7136aa6f72847d1ec498eb1207f96a474e7bc3112439543ffe556608a0faf2d9","sha256:7602d2bd7fcf6c0a61ac3170bae94dcac3c6c07aff4f88a5a599352f48fc0427"],"state_sha256":"d43776ebce892041f3cd4169f0678a01ce5f4f1024a518254169042d9eaf3e8a"}