{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:VDBFIL3KQHFINLT44GFXEICJYQ","short_pith_number":"pith:VDBFIL3K","schema_version":"1.0","canonical_sha256":"a8c2542f6a81ca86ae7ce18b722049c429f506f8bc7d3d7b6efe42004618966e","source":{"kind":"arxiv","id":"1404.0528","version":1},"attestation_state":"computed","paper":{"title":"Cyclic, Simple and Indecomposable Three-fold Triple Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bradley Sheppard, Daniela Silvesan, Nabil Shalaby","submitted_at":"2014-04-02T12:14:27Z","abstract_excerpt":"In 2000, Rees and Shalaby constructed simple indecomposable two-fold cyclic triple systems for all v congruent to 0, 1, 3, 4, 7, and 9 (mod 12) where v = 4 or v>11, using Skolem-type sequences. We construct, using Skolem-type sequences, three-fold triple systems having the properties of being cyclic, simple, and indecomposable for all admissible orders v, with some possible exceptions for v = 9 and v = 24c + 57, where c >1 is a constant. To prove the simplicity we used a Mathematica computer program. We list in the Appendix the code and the results of the program."},"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":"1404.0528","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-04-02T12:14:27Z","cross_cats_sorted":[],"title_canon_sha256":"db561efee61424e80bd72f484955ad7a1832571ed5b34e3924e541e93a269413","abstract_canon_sha256":"ac2c7395e0760429f7ba0417942b1098bbc674483e4d7c0f8a7f9ce46e08d2f1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:55:03.161161Z","signature_b64":"DDKnmQE++rAvoED3/4Z0YU8xIg18CVAJQiLxU39oopdrMvnoDjdM3uPq3aMchZMomRzAVurySEaXivxLVYreCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a8c2542f6a81ca86ae7ce18b722049c429f506f8bc7d3d7b6efe42004618966e","last_reissued_at":"2026-05-18T02:55:03.160767Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:55:03.160767Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cyclic, Simple and Indecomposable Three-fold Triple Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bradley Sheppard, Daniela Silvesan, Nabil Shalaby","submitted_at":"2014-04-02T12:14:27Z","abstract_excerpt":"In 2000, Rees and Shalaby constructed simple indecomposable two-fold cyclic triple systems for all v congruent to 0, 1, 3, 4, 7, and 9 (mod 12) where v = 4 or v>11, using Skolem-type sequences. We construct, using Skolem-type sequences, three-fold triple systems having the properties of being cyclic, simple, and indecomposable for all admissible orders v, with some possible exceptions for v = 9 and v = 24c + 57, where c >1 is a constant. To prove the simplicity we used a Mathematica computer program. We list in the Appendix the code and the results of the program."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.0528","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":"1404.0528","created_at":"2026-05-18T02:55:03.160833+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.0528v1","created_at":"2026-05-18T02:55:03.160833+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.0528","created_at":"2026-05-18T02:55:03.160833+00:00"},{"alias_kind":"pith_short_12","alias_value":"VDBFIL3KQHFI","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_16","alias_value":"VDBFIL3KQHFINLT4","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_8","alias_value":"VDBFIL3K","created_at":"2026-05-18T12:28:52.271510+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/VDBFIL3KQHFINLT44GFXEICJYQ","json":"https://pith.science/pith/VDBFIL3KQHFINLT44GFXEICJYQ.json","graph_json":"https://pith.science/api/pith-number/VDBFIL3KQHFINLT44GFXEICJYQ/graph.json","events_json":"https://pith.science/api/pith-number/VDBFIL3KQHFINLT44GFXEICJYQ/events.json","paper":"https://pith.science/paper/VDBFIL3K"},"agent_actions":{"view_html":"https://pith.science/pith/VDBFIL3KQHFINLT44GFXEICJYQ","download_json":"https://pith.science/pith/VDBFIL3KQHFINLT44GFXEICJYQ.json","view_paper":"https://pith.science/paper/VDBFIL3K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.0528&json=true","fetch_graph":"https://pith.science/api/pith-number/VDBFIL3KQHFINLT44GFXEICJYQ/graph.json","fetch_events":"https://pith.science/api/pith-number/VDBFIL3KQHFINLT44GFXEICJYQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VDBFIL3KQHFINLT44GFXEICJYQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VDBFIL3KQHFINLT44GFXEICJYQ/action/storage_attestation","attest_author":"https://pith.science/pith/VDBFIL3KQHFINLT44GFXEICJYQ/action/author_attestation","sign_citation":"https://pith.science/pith/VDBFIL3KQHFINLT44GFXEICJYQ/action/citation_signature","submit_replication":"https://pith.science/pith/VDBFIL3KQHFINLT44GFXEICJYQ/action/replication_record"}},"created_at":"2026-05-18T02:55:03.160833+00:00","updated_at":"2026-05-18T02:55:03.160833+00:00"}