{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:2IYYTLGEZVBQWES6NCKVGNQQKU","short_pith_number":"pith:2IYYTLGE","canonical_record":{"source":{"id":"1111.5357","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-11-22T22:38:55Z","cross_cats_sorted":["cs.DS","cs.FL"],"title_canon_sha256":"04794f7ea7695a21a7b9cb2f9dcbea4ce3e1c9960775ba7a144263da80050c42","abstract_canon_sha256":"9feb446d8e3eb41cc96448b4d40255e866edccaf10388039099f63dc644b22df"},"schema_version":"1.0"},"canonical_sha256":"d23189acc4cd430b125e68955336105506f7ac4f26f073bc4a95d7ac68d33204","source":{"kind":"arxiv","id":"1111.5357","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.5357","created_at":"2026-05-18T03:27:54Z"},{"alias_kind":"arxiv_version","alias_value":"1111.5357v1","created_at":"2026-05-18T03:27:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.5357","created_at":"2026-05-18T03:27:54Z"},{"alias_kind":"pith_short_12","alias_value":"2IYYTLGEZVBQ","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"2IYYTLGEZVBQWES6","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"2IYYTLGE","created_at":"2026-05-18T12:26:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:2IYYTLGEZVBQWES6NCKVGNQQKU","target":"record","payload":{"canonical_record":{"source":{"id":"1111.5357","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-11-22T22:38:55Z","cross_cats_sorted":["cs.DS","cs.FL"],"title_canon_sha256":"04794f7ea7695a21a7b9cb2f9dcbea4ce3e1c9960775ba7a144263da80050c42","abstract_canon_sha256":"9feb446d8e3eb41cc96448b4d40255e866edccaf10388039099f63dc644b22df"},"schema_version":"1.0"},"canonical_sha256":"d23189acc4cd430b125e68955336105506f7ac4f26f073bc4a95d7ac68d33204","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:27:54.913739Z","signature_b64":"0rrgzH87vJsOuw4yRlpDbPuVaOF1kPYp2SUM0p4eUPacnAn7iC6/+Kaq3VH7hhLlhvfpV9bSYDItFU//UETyCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d23189acc4cd430b125e68955336105506f7ac4f26f073bc4a95d7ac68d33204","last_reissued_at":"2026-05-18T03:27:54.913083Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:27:54.913083Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1111.5357","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-18T03:27:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hHcX95Q7gDEvE7jCUXsSWiFb7J06wihYBRHLso0c+mV8xTSk+E/PnIiHteP4ktZ4AH+dSREQWYA7PpQqFMlVAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T08:39:04.700925Z"},"content_sha256":"8431727b4d9bdb83bbed2109d35048c4498dcbc8e19c7fc3d27d2d83f71642d6","schema_version":"1.0","event_id":"sha256:8431727b4d9bdb83bbed2109d35048c4498dcbc8e19c7fc3d27d2d83f71642d6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:2IYYTLGEZVBQWES6NCKVGNQQKU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Digraph Complexity Measures and Applications in Formal Language Theory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.FL"],"primary_cat":"cs.DM","authors_text":"Hermann Gruber","submitted_at":"2011-11-22T22:38:55Z","abstract_excerpt":"We investigate structural complexity measures on digraphs, in particular the cycle rank. This concept is intimately related to a classical topic in formal language theory, namely the star height of regular languages. We explore this connection, and obtain several new algorithmic insights regarding both cycle rank and star height. Among other results, we show that computing the cycle rank is NP-complete, even for sparse digraphs of maximum outdegree 2. Notwithstanding, we provide both a polynomial-time approximation algorithm and an exponential-time exact algorithm for this problem. The former "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.5357","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-18T03:27:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"13RgrnX1m6ce9YQuUjsleh4WDEGeJmNx46tsC5agInduPeG03YJvjCeMKqJ6KgmeJklIwwUElpt0kzaFQ5EnDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T08:39:04.701270Z"},"content_sha256":"a748db05867b4f9b4f5543f8a727c30b0197a39310fd432192da3819745b36cb","schema_version":"1.0","event_id":"sha256:a748db05867b4f9b4f5543f8a727c30b0197a39310fd432192da3819745b36cb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2IYYTLGEZVBQWES6NCKVGNQQKU/bundle.json","state_url":"https://pith.science/pith/2IYYTLGEZVBQWES6NCKVGNQQKU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2IYYTLGEZVBQWES6NCKVGNQQKU/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-25T08:39:04Z","links":{"resolver":"https://pith.science/pith/2IYYTLGEZVBQWES6NCKVGNQQKU","bundle":"https://pith.science/pith/2IYYTLGEZVBQWES6NCKVGNQQKU/bundle.json","state":"https://pith.science/pith/2IYYTLGEZVBQWES6NCKVGNQQKU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2IYYTLGEZVBQWES6NCKVGNQQKU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:2IYYTLGEZVBQWES6NCKVGNQQKU","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":"9feb446d8e3eb41cc96448b4d40255e866edccaf10388039099f63dc644b22df","cross_cats_sorted":["cs.DS","cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-11-22T22:38:55Z","title_canon_sha256":"04794f7ea7695a21a7b9cb2f9dcbea4ce3e1c9960775ba7a144263da80050c42"},"schema_version":"1.0","source":{"id":"1111.5357","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.5357","created_at":"2026-05-18T03:27:54Z"},{"alias_kind":"arxiv_version","alias_value":"1111.5357v1","created_at":"2026-05-18T03:27:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.5357","created_at":"2026-05-18T03:27:54Z"},{"alias_kind":"pith_short_12","alias_value":"2IYYTLGEZVBQ","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"2IYYTLGEZVBQWES6","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"2IYYTLGE","created_at":"2026-05-18T12:26:18Z"}],"graph_snapshots":[{"event_id":"sha256:a748db05867b4f9b4f5543f8a727c30b0197a39310fd432192da3819745b36cb","target":"graph","created_at":"2026-05-18T03:27:54Z","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 investigate structural complexity measures on digraphs, in particular the cycle rank. This concept is intimately related to a classical topic in formal language theory, namely the star height of regular languages. We explore this connection, and obtain several new algorithmic insights regarding both cycle rank and star height. Among other results, we show that computing the cycle rank is NP-complete, even for sparse digraphs of maximum outdegree 2. Notwithstanding, we provide both a polynomial-time approximation algorithm and an exponential-time exact algorithm for this problem. The former ","authors_text":"Hermann Gruber","cross_cats":["cs.DS","cs.FL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-11-22T22:38:55Z","title":"Digraph Complexity Measures and Applications in Formal Language Theory"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.5357","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:8431727b4d9bdb83bbed2109d35048c4498dcbc8e19c7fc3d27d2d83f71642d6","target":"record","created_at":"2026-05-18T03:27:54Z","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":"9feb446d8e3eb41cc96448b4d40255e866edccaf10388039099f63dc644b22df","cross_cats_sorted":["cs.DS","cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-11-22T22:38:55Z","title_canon_sha256":"04794f7ea7695a21a7b9cb2f9dcbea4ce3e1c9960775ba7a144263da80050c42"},"schema_version":"1.0","source":{"id":"1111.5357","kind":"arxiv","version":1}},"canonical_sha256":"d23189acc4cd430b125e68955336105506f7ac4f26f073bc4a95d7ac68d33204","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d23189acc4cd430b125e68955336105506f7ac4f26f073bc4a95d7ac68d33204","first_computed_at":"2026-05-18T03:27:54.913083Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:27:54.913083Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0rrgzH87vJsOuw4yRlpDbPuVaOF1kPYp2SUM0p4eUPacnAn7iC6/+Kaq3VH7hhLlhvfpV9bSYDItFU//UETyCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:27:54.913739Z","signed_message":"canonical_sha256_bytes"},"source_id":"1111.5357","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8431727b4d9bdb83bbed2109d35048c4498dcbc8e19c7fc3d27d2d83f71642d6","sha256:a748db05867b4f9b4f5543f8a727c30b0197a39310fd432192da3819745b36cb"],"state_sha256":"c072d9020d243823221e86ebf19b6018a59d0d200776af489c076c098d2bc61c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5uMN4Yojlw9MsKFJw7tMUr/AOiqQckUN92R2nDsW65A3EuUQIV/SgsT8tpSrvvjiH2adklo+Vsy0Bp0N/mEyBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T08:39:04.703201Z","bundle_sha256":"5061d2fa31dd72bd9da46c7ca62134dee56105d015178a6412a157b7095d9091"}}