{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:7OVBGMZI4AOIBUNY43QJPXGI2P","short_pith_number":"pith:7OVBGMZI","schema_version":"1.0","canonical_sha256":"fbaa133328e01c80d1b8e6e097dcc8d3c79e1ddd22de1447c97aaa3022178d29","source":{"kind":"arxiv","id":"1506.06618","version":1},"attestation_state":"computed","paper":{"title":"Uniformly resolvable $(C_4, K_{1,3})$-designs of order $v$ and index $2$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"E. S. Yazici, M. Gionfriddo, S. Kucukcifci, S. Milici","submitted_at":"2015-06-22T14:18:21Z","abstract_excerpt":"In this paper we consider the uniformly resolvable decompositions of the complete graph $2K_v$ into subgraphs where each resolution class contains only blocks isomorphic to the same graph. We completely determine the spectrum for the cases in which all the resolution classes are either $C_4$ or $K_{1,3}$."},"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":"1506.06618","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-06-22T14:18:21Z","cross_cats_sorted":[],"title_canon_sha256":"d0707b3d47136956fec9e42ff203dd056a2bc5be3ba797b159f4ec7614ceae89","abstract_canon_sha256":"85b3843165df3087caefcf7a940dad85562dccfb510c2b30bc436edc56b21d50"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:41:44.730662Z","signature_b64":"Fuf5ROSQpPWe1iEdL9FlVpPtlm+aAIRVcSYyaKlU1g2LFoM5c8dg/CzAzPK9uNhef1dGHMvpY8Lxq+vrMDj0BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fbaa133328e01c80d1b8e6e097dcc8d3c79e1ddd22de1447c97aaa3022178d29","last_reissued_at":"2026-05-18T01:41:44.730083Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:41:44.730083Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Uniformly resolvable $(C_4, K_{1,3})$-designs of order $v$ and index $2$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"E. S. Yazici, M. Gionfriddo, S. Kucukcifci, S. Milici","submitted_at":"2015-06-22T14:18:21Z","abstract_excerpt":"In this paper we consider the uniformly resolvable decompositions of the complete graph $2K_v$ into subgraphs where each resolution class contains only blocks isomorphic to the same graph. We completely determine the spectrum for the cases in which all the resolution classes are either $C_4$ or $K_{1,3}$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.06618","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":"1506.06618","created_at":"2026-05-18T01:41:44.730185+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.06618v1","created_at":"2026-05-18T01:41:44.730185+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.06618","created_at":"2026-05-18T01:41:44.730185+00:00"},{"alias_kind":"pith_short_12","alias_value":"7OVBGMZI4AOI","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_16","alias_value":"7OVBGMZI4AOIBUNY","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_8","alias_value":"7OVBGMZI","created_at":"2026-05-18T12:29:10.953037+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/7OVBGMZI4AOIBUNY43QJPXGI2P","json":"https://pith.science/pith/7OVBGMZI4AOIBUNY43QJPXGI2P.json","graph_json":"https://pith.science/api/pith-number/7OVBGMZI4AOIBUNY43QJPXGI2P/graph.json","events_json":"https://pith.science/api/pith-number/7OVBGMZI4AOIBUNY43QJPXGI2P/events.json","paper":"https://pith.science/paper/7OVBGMZI"},"agent_actions":{"view_html":"https://pith.science/pith/7OVBGMZI4AOIBUNY43QJPXGI2P","download_json":"https://pith.science/pith/7OVBGMZI4AOIBUNY43QJPXGI2P.json","view_paper":"https://pith.science/paper/7OVBGMZI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.06618&json=true","fetch_graph":"https://pith.science/api/pith-number/7OVBGMZI4AOIBUNY43QJPXGI2P/graph.json","fetch_events":"https://pith.science/api/pith-number/7OVBGMZI4AOIBUNY43QJPXGI2P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7OVBGMZI4AOIBUNY43QJPXGI2P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7OVBGMZI4AOIBUNY43QJPXGI2P/action/storage_attestation","attest_author":"https://pith.science/pith/7OVBGMZI4AOIBUNY43QJPXGI2P/action/author_attestation","sign_citation":"https://pith.science/pith/7OVBGMZI4AOIBUNY43QJPXGI2P/action/citation_signature","submit_replication":"https://pith.science/pith/7OVBGMZI4AOIBUNY43QJPXGI2P/action/replication_record"}},"created_at":"2026-05-18T01:41:44.730185+00:00","updated_at":"2026-05-18T01:41:44.730185+00:00"}