{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:FPACNIGT62HLSNZEVPAYW424I4","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":"4a12da7026bc1478aed82772a4f7ee05389ee8f9fbd3a3a0b9461704204fb55b","cross_cats_sorted":["cs.LO"],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.CO","submitted_at":"2023-09-09T23:04:00Z","title_canon_sha256":"08d05a9225efd88df938b1282625541178cef65759ffcaf96c0fcd579fa64fa3"},"schema_version":"1.0","source":{"id":"2309.04892","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2309.04892","created_at":"2026-07-05T06:49:28Z"},{"alias_kind":"arxiv_version","alias_value":"2309.04892v1","created_at":"2026-07-05T06:49:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.04892","created_at":"2026-07-05T06:49:28Z"},{"alias_kind":"pith_short_12","alias_value":"FPACNIGT62HL","created_at":"2026-07-05T06:49:28Z"},{"alias_kind":"pith_short_16","alias_value":"FPACNIGT62HLSNZE","created_at":"2026-07-05T06:49:28Z"},{"alias_kind":"pith_short_8","alias_value":"FPACNIGT","created_at":"2026-07-05T06:49:28Z"}],"graph_snapshots":[{"event_id":"sha256:6909effbd96bc7dccaf6c25a0787e8c3f62c9e3249726f786afede7a0af7a767","target":"graph","created_at":"2026-07-05T06:49:28Z","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/2309.04892/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Let $G$ be a graph on $n$ vertices with adjacency matrix $A$, and let $\\mathbf{1}$ be the all-ones vector. We call $G$ controllable if the set of vectors $\\mathbf{1}, A\\mathbf{1}, \\dots, A^{n-1}\\mathbf{1}$ spans the whole space $\\mathbb{R}^n$. We characterize the isomorphism problem of controllable graphs in terms of other combinatorial, geometric and logical problems. We also describe a polynomial time algorithm for graph isomorphism that works for almost all graphs.","authors_text":"Aida Abiad, Anuj Dawar, Octavio Zapata","cross_cats":["cs.LO"],"headline":"","license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.CO","submitted_at":"2023-09-09T23:04:00Z","title":"Descriptive complexity of controllable graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.04892","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:4e9304b750559a2414b815515db9aa0efdae4bf88e603a074581f626945d40db","target":"record","created_at":"2026-07-05T06:49:28Z","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":"4a12da7026bc1478aed82772a4f7ee05389ee8f9fbd3a3a0b9461704204fb55b","cross_cats_sorted":["cs.LO"],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.CO","submitted_at":"2023-09-09T23:04:00Z","title_canon_sha256":"08d05a9225efd88df938b1282625541178cef65759ffcaf96c0fcd579fa64fa3"},"schema_version":"1.0","source":{"id":"2309.04892","kind":"arxiv","version":1}},"canonical_sha256":"2bc026a0d3f68eb93724abc18b735c47056b6853a79741819402b3f268f818e4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2bc026a0d3f68eb93724abc18b735c47056b6853a79741819402b3f268f818e4","first_computed_at":"2026-07-05T06:49:28.358939Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:49:28.358939Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qeU660hXYkoIMkRSVx0/lV2APniieRosL0nDkXJ+VZYkDoJpRARE46kQ3nWzJrPXLk5wjBXqea3txXqW5U2vDg==","signature_status":"signed_v1","signed_at":"2026-07-05T06:49:28.359416Z","signed_message":"canonical_sha256_bytes"},"source_id":"2309.04892","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4e9304b750559a2414b815515db9aa0efdae4bf88e603a074581f626945d40db","sha256:6909effbd96bc7dccaf6c25a0787e8c3f62c9e3249726f786afede7a0af7a767"],"state_sha256":"d2d197ffeffa0bb31aa6a5688f1382dabf4e5f007a92d9e26ddab70bd34f50a0"}