{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:L77IJ5R5R2QTWGTSMJAOAIWZJ6","short_pith_number":"pith:L77IJ5R5","schema_version":"1.0","canonical_sha256":"5ffe84f63d8ea13b1a726240e022d94f95d6900d5e8027407ec1999cdf6fae08","source":{"kind":"arxiv","id":"1603.01496","version":1},"attestation_state":"computed","paper":{"title":"Terraces for Small Groups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GR"],"primary_cat":"math.CO","authors_text":"M. A. Ollis","submitted_at":"2016-03-04T15:22:01Z","abstract_excerpt":"We use heuristic algorithms to find terraces for small groups. We show that Bailey's Conjecture (that all groups other than the non-cyclic elementary abelian 2-groups are terraced) holds up to order 511, except possibly at orders 256 and 384. We also show that Keedwell's Conjecture (that all non-abelian groups of order at least 10 are sequenceable) holds up to order 255, and for the groups $A_6$, $S_6$, $PSL(2,q_1)$ and $PGL(2, q_2)$ where $q_1$ and $q_2$ are prime powers with $3 \\leq q_1 \\leq 11$ and $3 \\leq q_2 \\leq 8$. A sequencing for a group of a given order implies the existence of a com"},"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":"1603.01496","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-03-04T15:22:01Z","cross_cats_sorted":["math.GR"],"title_canon_sha256":"19f80ef961e861cdc2820470e7e35149dd4ef636634efe87dbf6b2abd8bcbb01","abstract_canon_sha256":"66cc8a250f30943b037243dfb15730cd16c6209f904a521ef83601ddc31fcb07"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:35.885247Z","signature_b64":"qkRlGZ3LOMUl3j7x/pKYQFchLAsclXoZZ58Xi/exiY2sVLwRPZC07t9Oa+13p0GlGfYwhxnt/PX3ezWfiXpZAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5ffe84f63d8ea13b1a726240e022d94f95d6900d5e8027407ec1999cdf6fae08","last_reissued_at":"2026-05-18T01:19:35.884592Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:35.884592Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Terraces for Small Groups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GR"],"primary_cat":"math.CO","authors_text":"M. A. Ollis","submitted_at":"2016-03-04T15:22:01Z","abstract_excerpt":"We use heuristic algorithms to find terraces for small groups. We show that Bailey's Conjecture (that all groups other than the non-cyclic elementary abelian 2-groups are terraced) holds up to order 511, except possibly at orders 256 and 384. We also show that Keedwell's Conjecture (that all non-abelian groups of order at least 10 are sequenceable) holds up to order 255, and for the groups $A_6$, $S_6$, $PSL(2,q_1)$ and $PGL(2, q_2)$ where $q_1$ and $q_2$ are prime powers with $3 \\leq q_1 \\leq 11$ and $3 \\leq q_2 \\leq 8$. A sequencing for a group of a given order implies the existence of a com"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.01496","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":"1603.01496","created_at":"2026-05-18T01:19:35.884680+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.01496v1","created_at":"2026-05-18T01:19:35.884680+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.01496","created_at":"2026-05-18T01:19:35.884680+00:00"},{"alias_kind":"pith_short_12","alias_value":"L77IJ5R5R2QT","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_16","alias_value":"L77IJ5R5R2QTWGTS","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_8","alias_value":"L77IJ5R5","created_at":"2026-05-18T12:30:29.479603+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/L77IJ5R5R2QTWGTSMJAOAIWZJ6","json":"https://pith.science/pith/L77IJ5R5R2QTWGTSMJAOAIWZJ6.json","graph_json":"https://pith.science/api/pith-number/L77IJ5R5R2QTWGTSMJAOAIWZJ6/graph.json","events_json":"https://pith.science/api/pith-number/L77IJ5R5R2QTWGTSMJAOAIWZJ6/events.json","paper":"https://pith.science/paper/L77IJ5R5"},"agent_actions":{"view_html":"https://pith.science/pith/L77IJ5R5R2QTWGTSMJAOAIWZJ6","download_json":"https://pith.science/pith/L77IJ5R5R2QTWGTSMJAOAIWZJ6.json","view_paper":"https://pith.science/paper/L77IJ5R5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.01496&json=true","fetch_graph":"https://pith.science/api/pith-number/L77IJ5R5R2QTWGTSMJAOAIWZJ6/graph.json","fetch_events":"https://pith.science/api/pith-number/L77IJ5R5R2QTWGTSMJAOAIWZJ6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L77IJ5R5R2QTWGTSMJAOAIWZJ6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L77IJ5R5R2QTWGTSMJAOAIWZJ6/action/storage_attestation","attest_author":"https://pith.science/pith/L77IJ5R5R2QTWGTSMJAOAIWZJ6/action/author_attestation","sign_citation":"https://pith.science/pith/L77IJ5R5R2QTWGTSMJAOAIWZJ6/action/citation_signature","submit_replication":"https://pith.science/pith/L77IJ5R5R2QTWGTSMJAOAIWZJ6/action/replication_record"}},"created_at":"2026-05-18T01:19:35.884680+00:00","updated_at":"2026-05-18T01:19:35.884680+00:00"}