{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:BLAJ5HXHSVXJLLGBUCN3CWJNYQ","short_pith_number":"pith:BLAJ5HXH","canonical_record":{"source":{"id":"1509.05544","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-18T08:34:23Z","cross_cats_sorted":[],"title_canon_sha256":"1718983b237f78483c6620a04fe723f3fc17ceaac086c284611bdb89300e9a95","abstract_canon_sha256":"6877491d520e9fa5dfb4522a7d63ae2df0fe3c57255b9cef31fba7d02d0031f4"},"schema_version":"1.0"},"canonical_sha256":"0ac09e9ee7956e95acc1a09bb1592dc41d784fcac1b6d47b84a2f86ee73a10fa","source":{"kind":"arxiv","id":"1509.05544","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.05544","created_at":"2026-05-18T01:32:42Z"},{"alias_kind":"arxiv_version","alias_value":"1509.05544v1","created_at":"2026-05-18T01:32:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.05544","created_at":"2026-05-18T01:32:42Z"},{"alias_kind":"pith_short_12","alias_value":"BLAJ5HXHSVXJ","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"BLAJ5HXHSVXJLLGB","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"BLAJ5HXH","created_at":"2026-05-18T12:29:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:BLAJ5HXHSVXJLLGBUCN3CWJNYQ","target":"record","payload":{"canonical_record":{"source":{"id":"1509.05544","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-18T08:34:23Z","cross_cats_sorted":[],"title_canon_sha256":"1718983b237f78483c6620a04fe723f3fc17ceaac086c284611bdb89300e9a95","abstract_canon_sha256":"6877491d520e9fa5dfb4522a7d63ae2df0fe3c57255b9cef31fba7d02d0031f4"},"schema_version":"1.0"},"canonical_sha256":"0ac09e9ee7956e95acc1a09bb1592dc41d784fcac1b6d47b84a2f86ee73a10fa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:32:42.882355Z","signature_b64":"cX+7kFyV/6tMbGaY+BbM0lhLU+wM5FoNw3X5DrImvIPx0x4TXtk4WIoRP5uksBOTtIR4hWzB9YFZziS5eVdBAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0ac09e9ee7956e95acc1a09bb1592dc41d784fcac1b6d47b84a2f86ee73a10fa","last_reissued_at":"2026-05-18T01:32:42.881875Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:32:42.881875Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.05544","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-18T01:32:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CnHcLpHUn1SfyL6K4l3cyhQPXr9qvsnOi5sXOlGFw79EaUAcPW+gZQTtEez/MDNeeqgvgeb8vjfplYRnTbnuCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T08:02:30.674541Z"},"content_sha256":"b0352a5b95aa4187df4c4cf9593300af74b7c8e53f67eb2b6406d189fe15856d","schema_version":"1.0","event_id":"sha256:b0352a5b95aa4187df4c4cf9593300af74b7c8e53f67eb2b6406d189fe15856d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:BLAJ5HXHSVXJLLGBUCN3CWJNYQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Partitioning 2-edge-colored graphs by monochromatic paths and cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andras Gyarfas, Daniel Gerbner, Gabor N. Sarkozy, Janos Barat, Jozsef Balogh","submitted_at":"2015-09-18T08:34:23Z","abstract_excerpt":"We present results on partitioning the vertices of $2$-edge-colored graphs into monochromatic paths and cycles. We prove asymptotically the two-color case of a conjecture of S\\'ark\\\"ozy: the vertex set of every $2$-edge-colored graph can be partitioned into at most $2\\alpha(G)$ monochromatic cycles, where $\\alpha(G)$ denotes the independence number of $G$. Another direction, emerged recently from a conjecture of Schelp, is to consider colorings of graphs with given minimum degree. We prove that apart from $o(|V(G)|)$ vertices, the vertex set of any $2$-edge-colored graph $G$ with minimum degre"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.05544","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-18T01:32:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oKu5zP1rWkgVzHilV17zj00bFoHvVURKVHSudx/BQBiyL8ysyewHsq0RTirNsmJlkqGEizExHuc1k+FtFRLvDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T08:02:30.675106Z"},"content_sha256":"fa59c33f4a4bf1a7d0c7a8489336748b9aa97391c99c5ed75ca70e5fdb14617b","schema_version":"1.0","event_id":"sha256:fa59c33f4a4bf1a7d0c7a8489336748b9aa97391c99c5ed75ca70e5fdb14617b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BLAJ5HXHSVXJLLGBUCN3CWJNYQ/bundle.json","state_url":"https://pith.science/pith/BLAJ5HXHSVXJLLGBUCN3CWJNYQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BLAJ5HXHSVXJLLGBUCN3CWJNYQ/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-11T08:02:30Z","links":{"resolver":"https://pith.science/pith/BLAJ5HXHSVXJLLGBUCN3CWJNYQ","bundle":"https://pith.science/pith/BLAJ5HXHSVXJLLGBUCN3CWJNYQ/bundle.json","state":"https://pith.science/pith/BLAJ5HXHSVXJLLGBUCN3CWJNYQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BLAJ5HXHSVXJLLGBUCN3CWJNYQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:BLAJ5HXHSVXJLLGBUCN3CWJNYQ","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":"6877491d520e9fa5dfb4522a7d63ae2df0fe3c57255b9cef31fba7d02d0031f4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-18T08:34:23Z","title_canon_sha256":"1718983b237f78483c6620a04fe723f3fc17ceaac086c284611bdb89300e9a95"},"schema_version":"1.0","source":{"id":"1509.05544","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.05544","created_at":"2026-05-18T01:32:42Z"},{"alias_kind":"arxiv_version","alias_value":"1509.05544v1","created_at":"2026-05-18T01:32:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.05544","created_at":"2026-05-18T01:32:42Z"},{"alias_kind":"pith_short_12","alias_value":"BLAJ5HXHSVXJ","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"BLAJ5HXHSVXJLLGB","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"BLAJ5HXH","created_at":"2026-05-18T12:29:14Z"}],"graph_snapshots":[{"event_id":"sha256:fa59c33f4a4bf1a7d0c7a8489336748b9aa97391c99c5ed75ca70e5fdb14617b","target":"graph","created_at":"2026-05-18T01:32:42Z","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 present results on partitioning the vertices of $2$-edge-colored graphs into monochromatic paths and cycles. We prove asymptotically the two-color case of a conjecture of S\\'ark\\\"ozy: the vertex set of every $2$-edge-colored graph can be partitioned into at most $2\\alpha(G)$ monochromatic cycles, where $\\alpha(G)$ denotes the independence number of $G$. Another direction, emerged recently from a conjecture of Schelp, is to consider colorings of graphs with given minimum degree. We prove that apart from $o(|V(G)|)$ vertices, the vertex set of any $2$-edge-colored graph $G$ with minimum degre","authors_text":"Andras Gyarfas, Daniel Gerbner, Gabor N. Sarkozy, Janos Barat, Jozsef Balogh","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-18T08:34:23Z","title":"Partitioning 2-edge-colored graphs by monochromatic paths and cycles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.05544","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:b0352a5b95aa4187df4c4cf9593300af74b7c8e53f67eb2b6406d189fe15856d","target":"record","created_at":"2026-05-18T01:32:42Z","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":"6877491d520e9fa5dfb4522a7d63ae2df0fe3c57255b9cef31fba7d02d0031f4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-18T08:34:23Z","title_canon_sha256":"1718983b237f78483c6620a04fe723f3fc17ceaac086c284611bdb89300e9a95"},"schema_version":"1.0","source":{"id":"1509.05544","kind":"arxiv","version":1}},"canonical_sha256":"0ac09e9ee7956e95acc1a09bb1592dc41d784fcac1b6d47b84a2f86ee73a10fa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0ac09e9ee7956e95acc1a09bb1592dc41d784fcac1b6d47b84a2f86ee73a10fa","first_computed_at":"2026-05-18T01:32:42.881875Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:32:42.881875Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cX+7kFyV/6tMbGaY+BbM0lhLU+wM5FoNw3X5DrImvIPx0x4TXtk4WIoRP5uksBOTtIR4hWzB9YFZziS5eVdBAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:32:42.882355Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.05544","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b0352a5b95aa4187df4c4cf9593300af74b7c8e53f67eb2b6406d189fe15856d","sha256:fa59c33f4a4bf1a7d0c7a8489336748b9aa97391c99c5ed75ca70e5fdb14617b"],"state_sha256":"7b760750168c3e6c621e8232651fe55da092936549cbd8e5c1b710dfcc971566"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hTx5TUUn7/zdmrcLD410bAFVpOupIY0hiIO+0cJA7EbafWKbH+NWosBSEFhea3mD3YNXxKzYo9obDieVM42kAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T08:02:30.679431Z","bundle_sha256":"2e5d59ae4e960eb952a859867190b100896ff354cb445965479eab3b6af77811"}}