{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:5NLCJD6KLHLPQOPFAWRYOTYU6U","short_pith_number":"pith:5NLCJD6K","schema_version":"1.0","canonical_sha256":"eb56248fca59d6f839e505a3874f14f5083315ee0084e86c35406efcec87d5f3","source":{"kind":"arxiv","id":"1204.2589","version":2},"attestation_state":"computed","paper":{"title":"1-Overlap Cycles for Steiner Triple Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Glenn Hurlbert, Victoria Horan","submitted_at":"2012-04-11T23:13:11Z","abstract_excerpt":"A number of applications of Steiner triple systems (e.g. disk erasure codes) exist that require a special ordering of its blocks. Universal cycles, introduced by Chung, Diaconis, and Graham in 1992, and Gray codes are examples of listing elements of a combinatorial family in a specific manner, and Godbole invented the following generalization of these in 2010. 1-overlap cycles require a set of strings to be ordered so that the last letter of one string is the first letter of the next. In this paper, we prove the existence of 1-overlap cycles for automorphism free Steiner triple systems of each"},"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":"1204.2589","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-04-11T23:13:11Z","cross_cats_sorted":[],"title_canon_sha256":"41404bd32df1c613633ad751423236c93bef4d1a1ff192801d37fd763be0fc93","abstract_canon_sha256":"b6cfdebd9a0ffef1c3053d4866794fbfa0e8f3cf84ce683fcf3b70a5d5dc22ed"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:35:38.591627Z","signature_b64":"mI5N3o1rA/vZSx6m4mPsPVBcguVuTV8MEcS6iXJfOc/G7w2/DaB4+7DkdBqmlSLTSgUuLObrKUhoHTLFsgGxBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eb56248fca59d6f839e505a3874f14f5083315ee0084e86c35406efcec87d5f3","last_reissued_at":"2026-05-18T03:35:38.590747Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:35:38.590747Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"1-Overlap Cycles for Steiner Triple Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Glenn Hurlbert, Victoria Horan","submitted_at":"2012-04-11T23:13:11Z","abstract_excerpt":"A number of applications of Steiner triple systems (e.g. disk erasure codes) exist that require a special ordering of its blocks. Universal cycles, introduced by Chung, Diaconis, and Graham in 1992, and Gray codes are examples of listing elements of a combinatorial family in a specific manner, and Godbole invented the following generalization of these in 2010. 1-overlap cycles require a set of strings to be ordered so that the last letter of one string is the first letter of the next. In this paper, we prove the existence of 1-overlap cycles for automorphism free Steiner triple systems of each"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.2589","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":"1204.2589","created_at":"2026-05-18T03:35:38.590900+00:00"},{"alias_kind":"arxiv_version","alias_value":"1204.2589v2","created_at":"2026-05-18T03:35:38.590900+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.2589","created_at":"2026-05-18T03:35:38.590900+00:00"},{"alias_kind":"pith_short_12","alias_value":"5NLCJD6KLHLP","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_16","alias_value":"5NLCJD6KLHLPQOPF","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_8","alias_value":"5NLCJD6K","created_at":"2026-05-18T12:26:56.085431+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/5NLCJD6KLHLPQOPFAWRYOTYU6U","json":"https://pith.science/pith/5NLCJD6KLHLPQOPFAWRYOTYU6U.json","graph_json":"https://pith.science/api/pith-number/5NLCJD6KLHLPQOPFAWRYOTYU6U/graph.json","events_json":"https://pith.science/api/pith-number/5NLCJD6KLHLPQOPFAWRYOTYU6U/events.json","paper":"https://pith.science/paper/5NLCJD6K"},"agent_actions":{"view_html":"https://pith.science/pith/5NLCJD6KLHLPQOPFAWRYOTYU6U","download_json":"https://pith.science/pith/5NLCJD6KLHLPQOPFAWRYOTYU6U.json","view_paper":"https://pith.science/paper/5NLCJD6K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1204.2589&json=true","fetch_graph":"https://pith.science/api/pith-number/5NLCJD6KLHLPQOPFAWRYOTYU6U/graph.json","fetch_events":"https://pith.science/api/pith-number/5NLCJD6KLHLPQOPFAWRYOTYU6U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5NLCJD6KLHLPQOPFAWRYOTYU6U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5NLCJD6KLHLPQOPFAWRYOTYU6U/action/storage_attestation","attest_author":"https://pith.science/pith/5NLCJD6KLHLPQOPFAWRYOTYU6U/action/author_attestation","sign_citation":"https://pith.science/pith/5NLCJD6KLHLPQOPFAWRYOTYU6U/action/citation_signature","submit_replication":"https://pith.science/pith/5NLCJD6KLHLPQOPFAWRYOTYU6U/action/replication_record"}},"created_at":"2026-05-18T03:35:38.590900+00:00","updated_at":"2026-05-18T03:35:38.590900+00:00"}