{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:4TWJP7WJ47LOOTUHWV35DGA7JY","short_pith_number":"pith:4TWJP7WJ","schema_version":"1.0","canonical_sha256":"e4ec97fec9e7d6e74e87b577d1981f4e3edc3eae4dd4f75c515bb577064c4f97","source":{"kind":"arxiv","id":"1402.4603","version":1},"attestation_state":"computed","paper":{"title":"Resolvable 3-star designs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Antoinette Tripodi, Giovanni Lo faro, Salvatore Milici, Selda Kucukcifci","submitted_at":"2014-02-19T09:40:02Z","abstract_excerpt":"Let Kv be the complete graph of order v and F be a set of 1-factors of Kv. In this article we study the existence of a resolvable decomposition of Kv - F into 3-stars when F has the minimum number of 1-factors. We completely solve the case in which F has the minimum number of 1- factors, with the possible exception of v in {40, 44, 52, 76, 92, 100, 280, 284, 328, 332, 428, 472, 476, 572}."},"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":"1402.4603","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-02-19T09:40:02Z","cross_cats_sorted":[],"title_canon_sha256":"d3583e99235e517e0c0f328a222722b990935eac339f956cdbd4ab2d9951fb8d","abstract_canon_sha256":"d265a2d2ac1be4316ee5471765705b88bda07535b04f2ca67dc49475f7ca071f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:58:33.718182Z","signature_b64":"80bosUP/OwKLo5V/QvSP7vEtjAdzgL2fCa38y1X55ioNvNw6dOGaIlF2CEX0xI68lsrmmomAeCU1bN52v3fLDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e4ec97fec9e7d6e74e87b577d1981f4e3edc3eae4dd4f75c515bb577064c4f97","last_reissued_at":"2026-05-18T02:58:33.717477Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:58:33.717477Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Resolvable 3-star designs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Antoinette Tripodi, Giovanni Lo faro, Salvatore Milici, Selda Kucukcifci","submitted_at":"2014-02-19T09:40:02Z","abstract_excerpt":"Let Kv be the complete graph of order v and F be a set of 1-factors of Kv. In this article we study the existence of a resolvable decomposition of Kv - F into 3-stars when F has the minimum number of 1-factors. We completely solve the case in which F has the minimum number of 1- factors, with the possible exception of v in {40, 44, 52, 76, 92, 100, 280, 284, 328, 332, 428, 472, 476, 572}."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.4603","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":"1402.4603","created_at":"2026-05-18T02:58:33.717607+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.4603v1","created_at":"2026-05-18T02:58:33.717607+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.4603","created_at":"2026-05-18T02:58:33.717607+00:00"},{"alias_kind":"pith_short_12","alias_value":"4TWJP7WJ47LO","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_16","alias_value":"4TWJP7WJ47LOOTUH","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_8","alias_value":"4TWJP7WJ","created_at":"2026-05-18T12:28:14.216126+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/4TWJP7WJ47LOOTUHWV35DGA7JY","json":"https://pith.science/pith/4TWJP7WJ47LOOTUHWV35DGA7JY.json","graph_json":"https://pith.science/api/pith-number/4TWJP7WJ47LOOTUHWV35DGA7JY/graph.json","events_json":"https://pith.science/api/pith-number/4TWJP7WJ47LOOTUHWV35DGA7JY/events.json","paper":"https://pith.science/paper/4TWJP7WJ"},"agent_actions":{"view_html":"https://pith.science/pith/4TWJP7WJ47LOOTUHWV35DGA7JY","download_json":"https://pith.science/pith/4TWJP7WJ47LOOTUHWV35DGA7JY.json","view_paper":"https://pith.science/paper/4TWJP7WJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.4603&json=true","fetch_graph":"https://pith.science/api/pith-number/4TWJP7WJ47LOOTUHWV35DGA7JY/graph.json","fetch_events":"https://pith.science/api/pith-number/4TWJP7WJ47LOOTUHWV35DGA7JY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4TWJP7WJ47LOOTUHWV35DGA7JY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4TWJP7WJ47LOOTUHWV35DGA7JY/action/storage_attestation","attest_author":"https://pith.science/pith/4TWJP7WJ47LOOTUHWV35DGA7JY/action/author_attestation","sign_citation":"https://pith.science/pith/4TWJP7WJ47LOOTUHWV35DGA7JY/action/citation_signature","submit_replication":"https://pith.science/pith/4TWJP7WJ47LOOTUHWV35DGA7JY/action/replication_record"}},"created_at":"2026-05-18T02:58:33.717607+00:00","updated_at":"2026-05-18T02:58:33.717607+00:00"}