{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2006:FGJA7UVKWCZP3GPSWPPZE7XTNX","short_pith_number":"pith:FGJA7UVK","schema_version":"1.0","canonical_sha256":"29920fd2aab0b2fd99f2b3df927ef36dd2be8b58c624695927afb71881687f82","source":{"kind":"arxiv","id":"math/0602011","version":1},"attestation_state":"computed","paper":{"title":"Infinite primitive directed graphs","license":"","headline":"","cross_cats":["math.GR"],"primary_cat":"math.CO","authors_text":"Simon Smith","submitted_at":"2006-02-01T11:19:10Z","abstract_excerpt":"A group $G$ of permutations of a set $\\Omega$ is {\\em primitive} if it acts transitively on $\\Omega$, and the only $G$-invariant equivalence relations on $\\Omega$ are the trivial and universal relations. A graph $\\Gamma$ is {\\em primitive} if its automorphism group acts primitively on its vertex set.\n  A graph $\\Gamma$ has {\\em connectivity one} if it is connected and there exists a vertex $\\alpha$ of $\\Gamma$, such that the induced graph $\\Gamma \\setminus \\{\\alpha\\}$ is not connected. If $\\Gamma$ has connectivity one, a {\\em block} of $\\Gamma$ is a connected subgraph that is maximal subject t"},"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":"math/0602011","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.CO","submitted_at":"2006-02-01T11:19:10Z","cross_cats_sorted":["math.GR"],"title_canon_sha256":"2c8f5bdb28583579cff908360d71b6dd256386b0fc20576d3c2d8112394717ed","abstract_canon_sha256":"f6d0e34e80df24ae8e733a29f659d312a0216f80abb03742c74a29aabdc0deac"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:33:14.563284Z","signature_b64":"4UMBGuSLEoAKwVDaqIwSlJ/47TgySJbAJOM7LY1+o55mlNmlhEaHFne3sbGJJKs+swlnvDkR+lONz7YCv8QTBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"29920fd2aab0b2fd99f2b3df927ef36dd2be8b58c624695927afb71881687f82","last_reissued_at":"2026-05-18T03:33:14.562588Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:33:14.562588Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Infinite primitive directed graphs","license":"","headline":"","cross_cats":["math.GR"],"primary_cat":"math.CO","authors_text":"Simon Smith","submitted_at":"2006-02-01T11:19:10Z","abstract_excerpt":"A group $G$ of permutations of a set $\\Omega$ is {\\em primitive} if it acts transitively on $\\Omega$, and the only $G$-invariant equivalence relations on $\\Omega$ are the trivial and universal relations. A graph $\\Gamma$ is {\\em primitive} if its automorphism group acts primitively on its vertex set.\n  A graph $\\Gamma$ has {\\em connectivity one} if it is connected and there exists a vertex $\\alpha$ of $\\Gamma$, such that the induced graph $\\Gamma \\setminus \\{\\alpha\\}$ is not connected. If $\\Gamma$ has connectivity one, a {\\em block} of $\\Gamma$ is a connected subgraph that is maximal subject t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0602011","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"math/0602011","created_at":"2026-05-18T03:33:14.562722+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0602011v1","created_at":"2026-05-18T03:33:14.562722+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0602011","created_at":"2026-05-18T03:33:14.562722+00:00"},{"alias_kind":"pith_short_12","alias_value":"FGJA7UVKWCZP","created_at":"2026-05-18T12:25:53.939244+00:00"},{"alias_kind":"pith_short_16","alias_value":"FGJA7UVKWCZP3GPS","created_at":"2026-05-18T12:25:53.939244+00:00"},{"alias_kind":"pith_short_8","alias_value":"FGJA7UVK","created_at":"2026-05-18T12:25:53.939244+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/FGJA7UVKWCZP3GPSWPPZE7XTNX","json":"https://pith.science/pith/FGJA7UVKWCZP3GPSWPPZE7XTNX.json","graph_json":"https://pith.science/api/pith-number/FGJA7UVKWCZP3GPSWPPZE7XTNX/graph.json","events_json":"https://pith.science/api/pith-number/FGJA7UVKWCZP3GPSWPPZE7XTNX/events.json","paper":"https://pith.science/paper/FGJA7UVK"},"agent_actions":{"view_html":"https://pith.science/pith/FGJA7UVKWCZP3GPSWPPZE7XTNX","download_json":"https://pith.science/pith/FGJA7UVKWCZP3GPSWPPZE7XTNX.json","view_paper":"https://pith.science/paper/FGJA7UVK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0602011&json=true","fetch_graph":"https://pith.science/api/pith-number/FGJA7UVKWCZP3GPSWPPZE7XTNX/graph.json","fetch_events":"https://pith.science/api/pith-number/FGJA7UVKWCZP3GPSWPPZE7XTNX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FGJA7UVKWCZP3GPSWPPZE7XTNX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FGJA7UVKWCZP3GPSWPPZE7XTNX/action/storage_attestation","attest_author":"https://pith.science/pith/FGJA7UVKWCZP3GPSWPPZE7XTNX/action/author_attestation","sign_citation":"https://pith.science/pith/FGJA7UVKWCZP3GPSWPPZE7XTNX/action/citation_signature","submit_replication":"https://pith.science/pith/FGJA7UVKWCZP3GPSWPPZE7XTNX/action/replication_record"}},"created_at":"2026-05-18T03:33:14.562722+00:00","updated_at":"2026-05-18T03:33:14.562722+00:00"}