{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:XICLOQCPJDKGC74JD2LK3UIVBZ","short_pith_number":"pith:XICLOQCP","schema_version":"1.0","canonical_sha256":"ba04b7404f48d4617f891e96add1150e60bc41059e882a5b19a038187b91e4d0","source":{"kind":"arxiv","id":"1705.09577","version":2},"attestation_state":"computed","paper":{"title":"The maximal subgroups and the complexity of the flow semigroup of finite (di)graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Chrystopher L. Nehaniv, G\\'abor Horv\\'ath, K\\'aroly Podoski","submitted_at":"2017-05-26T13:27:55Z","abstract_excerpt":"The flow semigroup, introduced by John Rhodes, is an invariant for digraphs and a complete invariant for graphs. After collecting together previous partial results, we refine and prove Rhodes's conjecture on the structure of the maximal groups in the flow semigroup for finite, antisymmetric, strongly connected digraphs.\n  Building on this result, we investigate and fully describe the structure and actions of the maximal subgroups of the flow semigroup acting on all but $k$ points for all finite digraphs and graphs for all $k\\geq 1$. A linear algorithm (in the number of edges) is presented to d"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1705.09577","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-26T13:27:55Z","cross_cats_sorted":[],"title_canon_sha256":"d0eeb43e3417d6f4f916c507ad27537f45a4a3acd9cf828ece7ae4ce2aeb2cea","abstract_canon_sha256":"5c5de520b6cf46f2b5e25cf212c0f75c9300c4356cb550dd41eff6487daa6d66"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:37:54.325571Z","signature_b64":"zJOrIrcxdsX0nUndGdzW5it8WrksNCp3qkqfw/B/jTME1vfaqbDXzBnU5iUlitIOaANh169pfZ4FEfeg84nqBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ba04b7404f48d4617f891e96add1150e60bc41059e882a5b19a038187b91e4d0","last_reissued_at":"2026-05-18T00:37:54.325062Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:37:54.325062Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The maximal subgroups and the complexity of the flow semigroup of finite (di)graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Chrystopher L. Nehaniv, G\\'abor Horv\\'ath, K\\'aroly Podoski","submitted_at":"2017-05-26T13:27:55Z","abstract_excerpt":"The flow semigroup, introduced by John Rhodes, is an invariant for digraphs and a complete invariant for graphs. After collecting together previous partial results, we refine and prove Rhodes's conjecture on the structure of the maximal groups in the flow semigroup for finite, antisymmetric, strongly connected digraphs.\n  Building on this result, we investigate and fully describe the structure and actions of the maximal subgroups of the flow semigroup acting on all but $k$ points for all finite digraphs and graphs for all $k\\geq 1$. A linear algorithm (in the number of edges) is presented to d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.09577","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1705.09577","created_at":"2026-05-18T00:37:54.325145+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.09577v2","created_at":"2026-05-18T00:37:54.325145+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.09577","created_at":"2026-05-18T00:37:54.325145+00:00"},{"alias_kind":"pith_short_12","alias_value":"XICLOQCPJDKG","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_16","alias_value":"XICLOQCPJDKGC74J","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_8","alias_value":"XICLOQCP","created_at":"2026-05-18T12:31:53.515858+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XICLOQCPJDKGC74JD2LK3UIVBZ","json":"https://pith.science/pith/XICLOQCPJDKGC74JD2LK3UIVBZ.json","graph_json":"https://pith.science/api/pith-number/XICLOQCPJDKGC74JD2LK3UIVBZ/graph.json","events_json":"https://pith.science/api/pith-number/XICLOQCPJDKGC74JD2LK3UIVBZ/events.json","paper":"https://pith.science/paper/XICLOQCP"},"agent_actions":{"view_html":"https://pith.science/pith/XICLOQCPJDKGC74JD2LK3UIVBZ","download_json":"https://pith.science/pith/XICLOQCPJDKGC74JD2LK3UIVBZ.json","view_paper":"https://pith.science/paper/XICLOQCP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.09577&json=true","fetch_graph":"https://pith.science/api/pith-number/XICLOQCPJDKGC74JD2LK3UIVBZ/graph.json","fetch_events":"https://pith.science/api/pith-number/XICLOQCPJDKGC74JD2LK3UIVBZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XICLOQCPJDKGC74JD2LK3UIVBZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XICLOQCPJDKGC74JD2LK3UIVBZ/action/storage_attestation","attest_author":"https://pith.science/pith/XICLOQCPJDKGC74JD2LK3UIVBZ/action/author_attestation","sign_citation":"https://pith.science/pith/XICLOQCPJDKGC74JD2LK3UIVBZ/action/citation_signature","submit_replication":"https://pith.science/pith/XICLOQCPJDKGC74JD2LK3UIVBZ/action/replication_record"}},"created_at":"2026-05-18T00:37:54.325145+00:00","updated_at":"2026-05-18T00:37:54.325145+00:00"}