{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:JAKVQ4Z7Q2L457HDVWGD5PZYW2","short_pith_number":"pith:JAKVQ4Z7","canonical_record":{"source":{"id":"1905.12151","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-05-29T00:55:39Z","cross_cats_sorted":[],"title_canon_sha256":"bb2b90741421bda83ecde4fa5ade1a30f80b7e53f8affc51417c8430376e10f1","abstract_canon_sha256":"1d8a6e07e8d7a28add5a79a6956f49fdc32898f81576e72a5d844e2bac741fef"},"schema_version":"1.0"},"canonical_sha256":"481558733f8697cefce3ad8c3ebf38b689098a3272e41498ff8edcf02a8670cd","source":{"kind":"arxiv","id":"1905.12151","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.12151","created_at":"2026-05-17T23:44:47Z"},{"alias_kind":"arxiv_version","alias_value":"1905.12151v1","created_at":"2026-05-17T23:44:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.12151","created_at":"2026-05-17T23:44:47Z"},{"alias_kind":"pith_short_12","alias_value":"JAKVQ4Z7Q2L4","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"JAKVQ4Z7Q2L457HD","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"JAKVQ4Z7","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:JAKVQ4Z7Q2L457HDVWGD5PZYW2","target":"record","payload":{"canonical_record":{"source":{"id":"1905.12151","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-05-29T00:55:39Z","cross_cats_sorted":[],"title_canon_sha256":"bb2b90741421bda83ecde4fa5ade1a30f80b7e53f8affc51417c8430376e10f1","abstract_canon_sha256":"1d8a6e07e8d7a28add5a79a6956f49fdc32898f81576e72a5d844e2bac741fef"},"schema_version":"1.0"},"canonical_sha256":"481558733f8697cefce3ad8c3ebf38b689098a3272e41498ff8edcf02a8670cd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:47.012347Z","signature_b64":"nwDSQtnxpEs2HW2+cVyhUDCpvxPxMgA4IdfsHVehTlVey+Em32JMAJAPpavnBLy3iaE7fImbVQdxUUdiKGGeBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"481558733f8697cefce3ad8c3ebf38b689098a3272e41498ff8edcf02a8670cd","last_reissued_at":"2026-05-17T23:44:47.011794Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:47.011794Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.12151","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:44:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CrZqFdPcyuvqkRO97lz4swURhfRjxsR+Ow7f3gYCLMeMbHOK/VXbXMyDEJeo0A+dUr6tqWvCkVgxT82wot8QAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T04:21:06.601172Z"},"content_sha256":"ded3bd9a1483a4b94353ece6e8927fbb094bbf42066fc347f0641a362d79b585","schema_version":"1.0","event_id":"sha256:ded3bd9a1483a4b94353ece6e8927fbb094bbf42066fc347f0641a362d79b585"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:JAKVQ4Z7Q2L457HDVWGD5PZYW2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Leaves for packings with block size four","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Peter J. Dukes, Tao Feng, Yanxun Chang","submitted_at":"2019-05-29T00:55:39Z","abstract_excerpt":"We consider maximum packings of edge-disjoint $4$-cliques in the complete graph $K_n$. When $n \\equiv 1$ or $4 \\pmod{12}$, these are simply block designs. In other congruence classes, there are necessarily uncovered edges; we examine the possible `leave' graphs induced by those edges. We give particular emphasis to the case $n \\equiv 0$ or $3 \\pmod{12}$, when the leave is $2$-regular. Colbourn and Ling settled the case of Hamiltonian leaves in this case. We extend their construction and use several additional direct and recursive constructions to realize a variety of $2$-regular leaves. For va"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.12151","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:44:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tMO0EameXS/xIyzeFQ4R+Gs1QZ2Ryn2nlocIE+eNiEvt2xHy/YuN8m9oGw5y8vuhdhW4yxWFxtEA+bC391N2Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T04:21:06.601543Z"},"content_sha256":"ec03e8017348f2beaa72177ad15625b3fd1165c09c5cf283829009a744b9954f","schema_version":"1.0","event_id":"sha256:ec03e8017348f2beaa72177ad15625b3fd1165c09c5cf283829009a744b9954f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JAKVQ4Z7Q2L457HDVWGD5PZYW2/bundle.json","state_url":"https://pith.science/pith/JAKVQ4Z7Q2L457HDVWGD5PZYW2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JAKVQ4Z7Q2L457HDVWGD5PZYW2/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-02T04:21:06Z","links":{"resolver":"https://pith.science/pith/JAKVQ4Z7Q2L457HDVWGD5PZYW2","bundle":"https://pith.science/pith/JAKVQ4Z7Q2L457HDVWGD5PZYW2/bundle.json","state":"https://pith.science/pith/JAKVQ4Z7Q2L457HDVWGD5PZYW2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JAKVQ4Z7Q2L457HDVWGD5PZYW2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:JAKVQ4Z7Q2L457HDVWGD5PZYW2","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"1d8a6e07e8d7a28add5a79a6956f49fdc32898f81576e72a5d844e2bac741fef","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-05-29T00:55:39Z","title_canon_sha256":"bb2b90741421bda83ecde4fa5ade1a30f80b7e53f8affc51417c8430376e10f1"},"schema_version":"1.0","source":{"id":"1905.12151","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.12151","created_at":"2026-05-17T23:44:47Z"},{"alias_kind":"arxiv_version","alias_value":"1905.12151v1","created_at":"2026-05-17T23:44:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.12151","created_at":"2026-05-17T23:44:47Z"},{"alias_kind":"pith_short_12","alias_value":"JAKVQ4Z7Q2L4","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"JAKVQ4Z7Q2L457HD","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"JAKVQ4Z7","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:ec03e8017348f2beaa72177ad15625b3fd1165c09c5cf283829009a744b9954f","target":"graph","created_at":"2026-05-17T23:44:47Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We consider maximum packings of edge-disjoint $4$-cliques in the complete graph $K_n$. When $n \\equiv 1$ or $4 \\pmod{12}$, these are simply block designs. In other congruence classes, there are necessarily uncovered edges; we examine the possible `leave' graphs induced by those edges. We give particular emphasis to the case $n \\equiv 0$ or $3 \\pmod{12}$, when the leave is $2$-regular. Colbourn and Ling settled the case of Hamiltonian leaves in this case. We extend their construction and use several additional direct and recursive constructions to realize a variety of $2$-regular leaves. For va","authors_text":"Peter J. Dukes, Tao Feng, Yanxun Chang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-05-29T00:55:39Z","title":"Leaves for packings with block size four"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.12151","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:ded3bd9a1483a4b94353ece6e8927fbb094bbf42066fc347f0641a362d79b585","target":"record","created_at":"2026-05-17T23:44:47Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"1d8a6e07e8d7a28add5a79a6956f49fdc32898f81576e72a5d844e2bac741fef","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-05-29T00:55:39Z","title_canon_sha256":"bb2b90741421bda83ecde4fa5ade1a30f80b7e53f8affc51417c8430376e10f1"},"schema_version":"1.0","source":{"id":"1905.12151","kind":"arxiv","version":1}},"canonical_sha256":"481558733f8697cefce3ad8c3ebf38b689098a3272e41498ff8edcf02a8670cd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"481558733f8697cefce3ad8c3ebf38b689098a3272e41498ff8edcf02a8670cd","first_computed_at":"2026-05-17T23:44:47.011794Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:47.011794Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nwDSQtnxpEs2HW2+cVyhUDCpvxPxMgA4IdfsHVehTlVey+Em32JMAJAPpavnBLy3iaE7fImbVQdxUUdiKGGeBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:47.012347Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.12151","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ded3bd9a1483a4b94353ece6e8927fbb094bbf42066fc347f0641a362d79b585","sha256:ec03e8017348f2beaa72177ad15625b3fd1165c09c5cf283829009a744b9954f"],"state_sha256":"c8bfc35eb6769dc7d8bd8148a3b3806d2694b112d73bb0f6bd123c5457bbec49"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6lUV1F/h57x8wz7hApwXtJUyisgfZ/vtENfGCcAfH41ljjcT7VKfMVkqVH91yHSU8xXOJnZOXEVgr6kKIOtwBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T04:21:06.603991Z","bundle_sha256":"3d99ffa23ed8da0c11eb4d4abf85ac93595e48652428bc631c9f9b6e71cd9bfc"}}