{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:MC4S75QNDTY6L4EOYTTH6LVOLS","short_pith_number":"pith:MC4S75QN","canonical_record":{"source":{"id":"1108.1616","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-08-08T07:32:16Z","cross_cats_sorted":[],"title_canon_sha256":"09b29f9b5a4ed4459b48d50caaadab43c0ad30645864a76b6a3a31063a8ad9f4","abstract_canon_sha256":"98009ed62f2f0e8bee623a2acaabacd72c63ca6dc0bfb76ed3a723c3ce573bcb"},"schema_version":"1.0"},"canonical_sha256":"60b92ff60d1cf1e5f08ec4e67f2eae5cb930c686f29a2dafe45e9f42a01c613b","source":{"kind":"arxiv","id":"1108.1616","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.1616","created_at":"2026-05-18T04:16:00Z"},{"alias_kind":"arxiv_version","alias_value":"1108.1616v1","created_at":"2026-05-18T04:16:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.1616","created_at":"2026-05-18T04:16:00Z"},{"alias_kind":"pith_short_12","alias_value":"MC4S75QNDTY6","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"MC4S75QNDTY6L4EO","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"MC4S75QN","created_at":"2026-05-18T12:26:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:MC4S75QNDTY6L4EOYTTH6LVOLS","target":"record","payload":{"canonical_record":{"source":{"id":"1108.1616","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-08-08T07:32:16Z","cross_cats_sorted":[],"title_canon_sha256":"09b29f9b5a4ed4459b48d50caaadab43c0ad30645864a76b6a3a31063a8ad9f4","abstract_canon_sha256":"98009ed62f2f0e8bee623a2acaabacd72c63ca6dc0bfb76ed3a723c3ce573bcb"},"schema_version":"1.0"},"canonical_sha256":"60b92ff60d1cf1e5f08ec4e67f2eae5cb930c686f29a2dafe45e9f42a01c613b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:16:00.569925Z","signature_b64":"iiNLzWZ8FM03vmgt3vEMUddt9qycK0BLGnS3KdnfgaFRD8FwKKT0LAvKtcPTl+roWfZc1XqEy898faq2+L9pBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"60b92ff60d1cf1e5f08ec4e67f2eae5cb930c686f29a2dafe45e9f42a01c613b","last_reissued_at":"2026-05-18T04:16:00.569193Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:16:00.569193Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1108.1616","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-18T04:16:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R3n5jU6mVoejnt2jtj4BNrVcAQLNl+OhCaG8jhyEKV4Ho/pS9GcBo4QT1nShscDcrtSqRs8cYI8Iz5BqkDlJAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T01:00:56.656777Z"},"content_sha256":"4b85ec72d8b645171b76b1415b4832ee217ec4fee8745168d840fba51086794e","schema_version":"1.0","event_id":"sha256:4b85ec72d8b645171b76b1415b4832ee217ec4fee8745168d840fba51086794e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:MC4S75QNDTY6L4EOYTTH6LVOLS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Colouring Edges with many Colours in Cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jaroslav Nesetril (KAM), Patrice Ossona De Mendez (CAMS), Xuding Zhu","submitted_at":"2011-08-08T07:32:16Z","abstract_excerpt":"The arboricity of a graph G is the minimum number of colours needed to colour the edges of G so that every cycle gets at least two colours. Given a positive integer p, we define the generalized p-arboricity Arb_p(G) of a graph G as the minimum number of colours needed to colour the edges of a multigraph G in such a way that every cycle C gets at least min(|C|; p + 1) colours. In the particular case where G has girth at least p + 1, Arb_p(G) is the minimum size of a partition of the edge set of G such that the union of any p parts induce a forest. If we require further that the edge colouring b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.1616","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-18T04:16:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3N3F7+vLHTokFuA1lT9Ey4UldSaIa1+stXyn/UZcL3TFpyzNd+WsRHcfXNVkxglRujrvlXcqjZCG0+gQqge1DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T01:00:56.657423Z"},"content_sha256":"4b8b541b51e1f1306955ca3c62887563c3ab62fd991d7f759f250fe641d6107b","schema_version":"1.0","event_id":"sha256:4b8b541b51e1f1306955ca3c62887563c3ab62fd991d7f759f250fe641d6107b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MC4S75QNDTY6L4EOYTTH6LVOLS/bundle.json","state_url":"https://pith.science/pith/MC4S75QNDTY6L4EOYTTH6LVOLS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MC4S75QNDTY6L4EOYTTH6LVOLS/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-05-31T01:00:56Z","links":{"resolver":"https://pith.science/pith/MC4S75QNDTY6L4EOYTTH6LVOLS","bundle":"https://pith.science/pith/MC4S75QNDTY6L4EOYTTH6LVOLS/bundle.json","state":"https://pith.science/pith/MC4S75QNDTY6L4EOYTTH6LVOLS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MC4S75QNDTY6L4EOYTTH6LVOLS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:MC4S75QNDTY6L4EOYTTH6LVOLS","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":"98009ed62f2f0e8bee623a2acaabacd72c63ca6dc0bfb76ed3a723c3ce573bcb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-08-08T07:32:16Z","title_canon_sha256":"09b29f9b5a4ed4459b48d50caaadab43c0ad30645864a76b6a3a31063a8ad9f4"},"schema_version":"1.0","source":{"id":"1108.1616","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.1616","created_at":"2026-05-18T04:16:00Z"},{"alias_kind":"arxiv_version","alias_value":"1108.1616v1","created_at":"2026-05-18T04:16:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.1616","created_at":"2026-05-18T04:16:00Z"},{"alias_kind":"pith_short_12","alias_value":"MC4S75QNDTY6","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"MC4S75QNDTY6L4EO","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"MC4S75QN","created_at":"2026-05-18T12:26:34Z"}],"graph_snapshots":[{"event_id":"sha256:4b8b541b51e1f1306955ca3c62887563c3ab62fd991d7f759f250fe641d6107b","target":"graph","created_at":"2026-05-18T04:16:00Z","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":"The arboricity of a graph G is the minimum number of colours needed to colour the edges of G so that every cycle gets at least two colours. Given a positive integer p, we define the generalized p-arboricity Arb_p(G) of a graph G as the minimum number of colours needed to colour the edges of a multigraph G in such a way that every cycle C gets at least min(|C|; p + 1) colours. In the particular case where G has girth at least p + 1, Arb_p(G) is the minimum size of a partition of the edge set of G such that the union of any p parts induce a forest. If we require further that the edge colouring b","authors_text":"Jaroslav Nesetril (KAM), Patrice Ossona De Mendez (CAMS), Xuding Zhu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-08-08T07:32:16Z","title":"Colouring Edges with many Colours in Cycles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.1616","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:4b85ec72d8b645171b76b1415b4832ee217ec4fee8745168d840fba51086794e","target":"record","created_at":"2026-05-18T04:16:00Z","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":"98009ed62f2f0e8bee623a2acaabacd72c63ca6dc0bfb76ed3a723c3ce573bcb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-08-08T07:32:16Z","title_canon_sha256":"09b29f9b5a4ed4459b48d50caaadab43c0ad30645864a76b6a3a31063a8ad9f4"},"schema_version":"1.0","source":{"id":"1108.1616","kind":"arxiv","version":1}},"canonical_sha256":"60b92ff60d1cf1e5f08ec4e67f2eae5cb930c686f29a2dafe45e9f42a01c613b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"60b92ff60d1cf1e5f08ec4e67f2eae5cb930c686f29a2dafe45e9f42a01c613b","first_computed_at":"2026-05-18T04:16:00.569193Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:16:00.569193Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iiNLzWZ8FM03vmgt3vEMUddt9qycK0BLGnS3KdnfgaFRD8FwKKT0LAvKtcPTl+roWfZc1XqEy898faq2+L9pBA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:16:00.569925Z","signed_message":"canonical_sha256_bytes"},"source_id":"1108.1616","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4b85ec72d8b645171b76b1415b4832ee217ec4fee8745168d840fba51086794e","sha256:4b8b541b51e1f1306955ca3c62887563c3ab62fd991d7f759f250fe641d6107b"],"state_sha256":"01f8ca7197903da6dad900f3217ec4d134044ca9a1427d923d439e17e4b73b2a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kg1UWZS5KgIzizw4eDgez3byPN4Ku5NEkxg2XRAIuXg+5TZhrwAK9LmLQcp5D9a2kwHUihAMpKCeIVE12oYBDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T01:00:56.660309Z","bundle_sha256":"c14beaa85a8c8bc635acf19b2fa96897b3aad0ac542305a27068ee1db483011e"}}