{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:EKGT26LPHR7BW5ZOOOTHLV6V4O","short_pith_number":"pith:EKGT26LP","canonical_record":{"source":{"id":"1408.0371","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-08-02T13:40:52Z","cross_cats_sorted":[],"title_canon_sha256":"d75bbaf1a6c711323e14b7e6ab392ee720e4624f006c8b71e984340c009b2972","abstract_canon_sha256":"648ab4d78a2503debb848de872d79dfc1d0cec903dd6c34b24725f2d5ce3b144"},"schema_version":"1.0"},"canonical_sha256":"228d3d796f3c7e1b772e73a675d7d5e3a6894cfebd7d299f1041652156cb3251","source":{"kind":"arxiv","id":"1408.0371","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.0371","created_at":"2026-05-18T02:45:57Z"},{"alias_kind":"arxiv_version","alias_value":"1408.0371v1","created_at":"2026-05-18T02:45:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.0371","created_at":"2026-05-18T02:45:57Z"},{"alias_kind":"pith_short_12","alias_value":"EKGT26LPHR7B","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"EKGT26LPHR7BW5ZO","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"EKGT26LP","created_at":"2026-05-18T12:28:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:EKGT26LPHR7BW5ZOOOTHLV6V4O","target":"record","payload":{"canonical_record":{"source":{"id":"1408.0371","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-08-02T13:40:52Z","cross_cats_sorted":[],"title_canon_sha256":"d75bbaf1a6c711323e14b7e6ab392ee720e4624f006c8b71e984340c009b2972","abstract_canon_sha256":"648ab4d78a2503debb848de872d79dfc1d0cec903dd6c34b24725f2d5ce3b144"},"schema_version":"1.0"},"canonical_sha256":"228d3d796f3c7e1b772e73a675d7d5e3a6894cfebd7d299f1041652156cb3251","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:45:57.251636Z","signature_b64":"YzBsIluJP2YPrj8W71kaMPG88rgojSWKPjX9opT80G7xeTUowWSQvbQ/whl0P9E3LjTw4GYsxTP3xmpCeYPXDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"228d3d796f3c7e1b772e73a675d7d5e3a6894cfebd7d299f1041652156cb3251","last_reissued_at":"2026-05-18T02:45:57.251072Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:45:57.251072Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1408.0371","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-18T02:45:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JLml+U1HPLBOW/SzHRFQ8GrS5m+s7Egt01Dz7K2n/Lnl0vARmJgjC5y1a8IMaBWiknQ0MrowAjRPLjIeA74bCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T15:04:37.310338Z"},"content_sha256":"27b3db32ff2543d2232ef289a3f6fb751c1cad5d98573eab35259fe258853fa7","schema_version":"1.0","event_id":"sha256:27b3db32ff2543d2232ef289a3f6fb751c1cad5d98573eab35259fe258853fa7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:EKGT26LPHR7BW5ZOOOTHLV6V4O","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A graph partition problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Peter J. Cameron, Sebastian M. Cioab\\u{a}","submitted_at":"2014-08-02T13:40:52Z","abstract_excerpt":"Given a graph $G$ on $n$ vertices, for which $m$ is it possible to partition the edge set of the $m$-fold complete graph $mK_n$ into copies of $G$? We show that there is an integer $m_0$, which we call the \\emph{partition modulus of $G$}, such that the set $M(G)$ of values of $m$ for which such a partition exists consists of all but finitely many multiples of $m_0$. Trivial divisibility conditions derived from $G$ give an integer $m_1$ which divides $m_0$; we call the quotient $m_0/m_1$ the \\emph{partition index of $G$}. It seems that most graphs $G$ have partition index equal to $1$, but we g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.0371","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-18T02:45:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FVobkTecM4iQjcGvwtzVkruUCRmdgLR0PiOfkL2heye0izX0GW0aR9XchNOLCtSkivtbjMyoeOXsiwhphqvaDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T15:04:37.310682Z"},"content_sha256":"f7e8dc4ac35ad06d5fa9e29c6a411e69414bdcb4e6d9300912523c1dd00decf5","schema_version":"1.0","event_id":"sha256:f7e8dc4ac35ad06d5fa9e29c6a411e69414bdcb4e6d9300912523c1dd00decf5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EKGT26LPHR7BW5ZOOOTHLV6V4O/bundle.json","state_url":"https://pith.science/pith/EKGT26LPHR7BW5ZOOOTHLV6V4O/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EKGT26LPHR7BW5ZOOOTHLV6V4O/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-02T15:04:37Z","links":{"resolver":"https://pith.science/pith/EKGT26LPHR7BW5ZOOOTHLV6V4O","bundle":"https://pith.science/pith/EKGT26LPHR7BW5ZOOOTHLV6V4O/bundle.json","state":"https://pith.science/pith/EKGT26LPHR7BW5ZOOOTHLV6V4O/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EKGT26LPHR7BW5ZOOOTHLV6V4O/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:EKGT26LPHR7BW5ZOOOTHLV6V4O","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":"648ab4d78a2503debb848de872d79dfc1d0cec903dd6c34b24725f2d5ce3b144","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-08-02T13:40:52Z","title_canon_sha256":"d75bbaf1a6c711323e14b7e6ab392ee720e4624f006c8b71e984340c009b2972"},"schema_version":"1.0","source":{"id":"1408.0371","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.0371","created_at":"2026-05-18T02:45:57Z"},{"alias_kind":"arxiv_version","alias_value":"1408.0371v1","created_at":"2026-05-18T02:45:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.0371","created_at":"2026-05-18T02:45:57Z"},{"alias_kind":"pith_short_12","alias_value":"EKGT26LPHR7B","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"EKGT26LPHR7BW5ZO","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"EKGT26LP","created_at":"2026-05-18T12:28:28Z"}],"graph_snapshots":[{"event_id":"sha256:f7e8dc4ac35ad06d5fa9e29c6a411e69414bdcb4e6d9300912523c1dd00decf5","target":"graph","created_at":"2026-05-18T02:45:57Z","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":"Given a graph $G$ on $n$ vertices, for which $m$ is it possible to partition the edge set of the $m$-fold complete graph $mK_n$ into copies of $G$? We show that there is an integer $m_0$, which we call the \\emph{partition modulus of $G$}, such that the set $M(G)$ of values of $m$ for which such a partition exists consists of all but finitely many multiples of $m_0$. Trivial divisibility conditions derived from $G$ give an integer $m_1$ which divides $m_0$; we call the quotient $m_0/m_1$ the \\emph{partition index of $G$}. It seems that most graphs $G$ have partition index equal to $1$, but we g","authors_text":"Peter J. Cameron, Sebastian M. Cioab\\u{a}","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-08-02T13:40:52Z","title":"A graph partition problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.0371","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:27b3db32ff2543d2232ef289a3f6fb751c1cad5d98573eab35259fe258853fa7","target":"record","created_at":"2026-05-18T02:45:57Z","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":"648ab4d78a2503debb848de872d79dfc1d0cec903dd6c34b24725f2d5ce3b144","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-08-02T13:40:52Z","title_canon_sha256":"d75bbaf1a6c711323e14b7e6ab392ee720e4624f006c8b71e984340c009b2972"},"schema_version":"1.0","source":{"id":"1408.0371","kind":"arxiv","version":1}},"canonical_sha256":"228d3d796f3c7e1b772e73a675d7d5e3a6894cfebd7d299f1041652156cb3251","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"228d3d796f3c7e1b772e73a675d7d5e3a6894cfebd7d299f1041652156cb3251","first_computed_at":"2026-05-18T02:45:57.251072Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:45:57.251072Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YzBsIluJP2YPrj8W71kaMPG88rgojSWKPjX9opT80G7xeTUowWSQvbQ/whl0P9E3LjTw4GYsxTP3xmpCeYPXDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:45:57.251636Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.0371","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:27b3db32ff2543d2232ef289a3f6fb751c1cad5d98573eab35259fe258853fa7","sha256:f7e8dc4ac35ad06d5fa9e29c6a411e69414bdcb4e6d9300912523c1dd00decf5"],"state_sha256":"e8a09c949c25332c80f6aeb5dfe4152b21e8d7c3327b2b17c91357acfbe6ffd2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HfejQT7ZTwKMoPLgFmgynAuB6oG89UCUFb1Z3irzVOo6vIX+brv8aWJ811/N5c4o7MPYu9cVuUwNUAwnbnynBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T15:04:37.312428Z","bundle_sha256":"02ab978614c2789b392b3b59ac5c6ba389b6860b07e2d6ac8eff554c8c437ad9"}}