{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:6DJBW2K3KJHPAVZQUB65Z7UNNR","short_pith_number":"pith:6DJBW2K3","schema_version":"1.0","canonical_sha256":"f0d21b695b524ef05730a07ddcfe8d6c438cdaeece6b086aa30e1fae1ba5525a","source":{"kind":"arxiv","id":"1310.7403","version":1},"attestation_state":"computed","paper":{"title":"Maximum uniformly resolvable decompositions of $K_v$ and $K_v - I$ into 3-stars and 3-cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Salvatore Milici, Selda K\\\"u\\c{c}\\\"uk\\c{c}if\\c{c}i, Zsolt Tuza","submitted_at":"2013-10-28T12:53:23Z","abstract_excerpt":"Let $K_v$ denote the complete graph of order $v$ and $K_v - I$ denote $K_v$ minus a 1-factor. In this article we investigate uniformly resolvable decompositions of $K_v$ and $K_v-I$ into $r$ classes containing only copies of $3$-stars and $s$ classes containing only copies of $3$-cycles. We completely determine the spectrum in the case where the number of resolution classes of 3-stars is maximum."},"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":"1310.7403","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-10-28T12:53:23Z","cross_cats_sorted":[],"title_canon_sha256":"2c4cc5afea0f227927b5f8d7d62c5659efbd635d337c9339f9526971996e1755","abstract_canon_sha256":"9e2255a27e99ab7162d690afd6fc7f196c7450d1e92ad0f9b4b2bf912c9286fc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:08:45.447013Z","signature_b64":"rdPMhD7xB48yUCTm5O1dBoaN3wBCmKXXh5YpuTJdrhatQWIf9ROPdgovPrBTKhNh0ltRi6JJEP3dxLoSy048AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f0d21b695b524ef05730a07ddcfe8d6c438cdaeece6b086aa30e1fae1ba5525a","last_reissued_at":"2026-05-18T03:08:45.446348Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:08:45.446348Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Maximum uniformly resolvable decompositions of $K_v$ and $K_v - I$ into 3-stars and 3-cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Salvatore Milici, Selda K\\\"u\\c{c}\\\"uk\\c{c}if\\c{c}i, Zsolt Tuza","submitted_at":"2013-10-28T12:53:23Z","abstract_excerpt":"Let $K_v$ denote the complete graph of order $v$ and $K_v - I$ denote $K_v$ minus a 1-factor. In this article we investigate uniformly resolvable decompositions of $K_v$ and $K_v-I$ into $r$ classes containing only copies of $3$-stars and $s$ classes containing only copies of $3$-cycles. We completely determine the spectrum in the case where the number of resolution classes of 3-stars is maximum."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.7403","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":"1310.7403","created_at":"2026-05-18T03:08:45.446450+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.7403v1","created_at":"2026-05-18T03:08:45.446450+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.7403","created_at":"2026-05-18T03:08:45.446450+00:00"},{"alias_kind":"pith_short_12","alias_value":"6DJBW2K3KJHP","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_16","alias_value":"6DJBW2K3KJHPAVZQ","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_8","alias_value":"6DJBW2K3","created_at":"2026-05-18T12:27:36.564083+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/6DJBW2K3KJHPAVZQUB65Z7UNNR","json":"https://pith.science/pith/6DJBW2K3KJHPAVZQUB65Z7UNNR.json","graph_json":"https://pith.science/api/pith-number/6DJBW2K3KJHPAVZQUB65Z7UNNR/graph.json","events_json":"https://pith.science/api/pith-number/6DJBW2K3KJHPAVZQUB65Z7UNNR/events.json","paper":"https://pith.science/paper/6DJBW2K3"},"agent_actions":{"view_html":"https://pith.science/pith/6DJBW2K3KJHPAVZQUB65Z7UNNR","download_json":"https://pith.science/pith/6DJBW2K3KJHPAVZQUB65Z7UNNR.json","view_paper":"https://pith.science/paper/6DJBW2K3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.7403&json=true","fetch_graph":"https://pith.science/api/pith-number/6DJBW2K3KJHPAVZQUB65Z7UNNR/graph.json","fetch_events":"https://pith.science/api/pith-number/6DJBW2K3KJHPAVZQUB65Z7UNNR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6DJBW2K3KJHPAVZQUB65Z7UNNR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6DJBW2K3KJHPAVZQUB65Z7UNNR/action/storage_attestation","attest_author":"https://pith.science/pith/6DJBW2K3KJHPAVZQUB65Z7UNNR/action/author_attestation","sign_citation":"https://pith.science/pith/6DJBW2K3KJHPAVZQUB65Z7UNNR/action/citation_signature","submit_replication":"https://pith.science/pith/6DJBW2K3KJHPAVZQUB65Z7UNNR/action/replication_record"}},"created_at":"2026-05-18T03:08:45.446450+00:00","updated_at":"2026-05-18T03:08:45.446450+00:00"}