{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:XD7ISN3ETGMUNQ57LLAY5ZT2GE","short_pith_number":"pith:XD7ISN3E","canonical_record":{"source":{"id":"1301.0450","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-01-03T13:23:41Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"2b4d9ba613c9f5ad8f640e920895419896d24bf22406402439ddfc6a041505ec","abstract_canon_sha256":"b3f0ecef825096636d06aa0f005855252c93b5baf04c0509ea6e4e97609f2d3e"},"schema_version":"1.0"},"canonical_sha256":"b8fe893764999946c3bf5ac18ee67a313025df77ed9f0a4143b1b3be81e170bc","source":{"kind":"arxiv","id":"1301.0450","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.0450","created_at":"2026-05-18T02:58:13Z"},{"alias_kind":"arxiv_version","alias_value":"1301.0450v2","created_at":"2026-05-18T02:58:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.0450","created_at":"2026-05-18T02:58:13Z"},{"alias_kind":"pith_short_12","alias_value":"XD7ISN3ETGMU","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"XD7ISN3ETGMUNQ57","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"XD7ISN3E","created_at":"2026-05-18T12:28:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:XD7ISN3ETGMUNQ57LLAY5ZT2GE","target":"record","payload":{"canonical_record":{"source":{"id":"1301.0450","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-01-03T13:23:41Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"2b4d9ba613c9f5ad8f640e920895419896d24bf22406402439ddfc6a041505ec","abstract_canon_sha256":"b3f0ecef825096636d06aa0f005855252c93b5baf04c0509ea6e4e97609f2d3e"},"schema_version":"1.0"},"canonical_sha256":"b8fe893764999946c3bf5ac18ee67a313025df77ed9f0a4143b1b3be81e170bc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:58:13.195164Z","signature_b64":"mj9pHjds3FM0mXCvU6o9qwfYQHSKd5lHxuhr9EO24ftzv1PwlLTq7qEHg1weudau9M2JYgoRL8rppE0SX7EcDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b8fe893764999946c3bf5ac18ee67a313025df77ed9f0a4143b1b3be81e170bc","last_reissued_at":"2026-05-18T02:58:13.194411Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:58:13.194411Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.0450","source_version":2,"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:58:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kqxW3+GXsZH/LShD0QKaCdDyAcyhP4VnjgjZ0dq6K8LiqpE3mbxPJPoqrkV0UyPA66zDoXM462ImRxp7Z9kEAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T01:27:37.533219Z"},"content_sha256":"c2b1ab5d7076af65d5c5ef691dff5d1720d3820a667bccc1aadbeaaa5bbf5a22","schema_version":"1.0","event_id":"sha256:c2b1ab5d7076af65d5c5ef691dff5d1720d3820a667bccc1aadbeaaa5bbf5a22"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:XD7ISN3ETGMUNQ57LLAY5ZT2GE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Long properly colored cycles in edge colored complete graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Guanghui Wang, Guizhen Liu, Tao Wang","submitted_at":"2013-01-03T13:23:41Z","abstract_excerpt":"Let $K_{n}^{c}$ denote a complete graph on $n$ vertices whose edges are colored in an arbitrary way. Let $\\Delta^{\\mathrm{mon}} (K_{n}^{c})$ denote the maximum number of edges of the same color incident with a vertex of $K_{n}^{c}$. A properly colored cycle (path) in $K_{n}^{c}$ is a cycle (path) in which adjacent edges have distinct colors. B. Bollob\\'{a}s and P. Erd\\\"{o}s (1976) proposed the following conjecture: if $\\Delta^{\\mathrm{mon}} (K_{n}^{c})<\\lfloor \\frac{n}{2} \\rfloor$, then $K_{n}^{c}$ contains a properly colored Hamiltonian cycle. Li, Wang and Zhou proved that if $\\Delta^{\\mathrm"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.0450","kind":"arxiv","version":2},"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:58:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gWMHVfXvO7MXAB5EJZxxm2zVPOc6uMumntptPJtAsHx9db9mqwI/Fhx0mry3rP89iqmIzvWQJ209HFa+0C3zDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T01:27:37.533592Z"},"content_sha256":"967bbdb45153b52bfdae7af0e4c6ce331bbd9ce5642a29ab292f8ee16b3e6c18","schema_version":"1.0","event_id":"sha256:967bbdb45153b52bfdae7af0e4c6ce331bbd9ce5642a29ab292f8ee16b3e6c18"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XD7ISN3ETGMUNQ57LLAY5ZT2GE/bundle.json","state_url":"https://pith.science/pith/XD7ISN3ETGMUNQ57LLAY5ZT2GE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XD7ISN3ETGMUNQ57LLAY5ZT2GE/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-02T01:27:37Z","links":{"resolver":"https://pith.science/pith/XD7ISN3ETGMUNQ57LLAY5ZT2GE","bundle":"https://pith.science/pith/XD7ISN3ETGMUNQ57LLAY5ZT2GE/bundle.json","state":"https://pith.science/pith/XD7ISN3ETGMUNQ57LLAY5ZT2GE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XD7ISN3ETGMUNQ57LLAY5ZT2GE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:XD7ISN3ETGMUNQ57LLAY5ZT2GE","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":"b3f0ecef825096636d06aa0f005855252c93b5baf04c0509ea6e4e97609f2d3e","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-01-03T13:23:41Z","title_canon_sha256":"2b4d9ba613c9f5ad8f640e920895419896d24bf22406402439ddfc6a041505ec"},"schema_version":"1.0","source":{"id":"1301.0450","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.0450","created_at":"2026-05-18T02:58:13Z"},{"alias_kind":"arxiv_version","alias_value":"1301.0450v2","created_at":"2026-05-18T02:58:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.0450","created_at":"2026-05-18T02:58:13Z"},{"alias_kind":"pith_short_12","alias_value":"XD7ISN3ETGMU","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"XD7ISN3ETGMUNQ57","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"XD7ISN3E","created_at":"2026-05-18T12:28:06Z"}],"graph_snapshots":[{"event_id":"sha256:967bbdb45153b52bfdae7af0e4c6ce331bbd9ce5642a29ab292f8ee16b3e6c18","target":"graph","created_at":"2026-05-18T02:58:13Z","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":"Let $K_{n}^{c}$ denote a complete graph on $n$ vertices whose edges are colored in an arbitrary way. Let $\\Delta^{\\mathrm{mon}} (K_{n}^{c})$ denote the maximum number of edges of the same color incident with a vertex of $K_{n}^{c}$. A properly colored cycle (path) in $K_{n}^{c}$ is a cycle (path) in which adjacent edges have distinct colors. B. Bollob\\'{a}s and P. Erd\\\"{o}s (1976) proposed the following conjecture: if $\\Delta^{\\mathrm{mon}} (K_{n}^{c})<\\lfloor \\frac{n}{2} \\rfloor$, then $K_{n}^{c}$ contains a properly colored Hamiltonian cycle. Li, Wang and Zhou proved that if $\\Delta^{\\mathrm","authors_text":"Guanghui Wang, Guizhen Liu, Tao Wang","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-01-03T13:23:41Z","title":"Long properly colored cycles in edge colored complete graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.0450","kind":"arxiv","version":2},"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:c2b1ab5d7076af65d5c5ef691dff5d1720d3820a667bccc1aadbeaaa5bbf5a22","target":"record","created_at":"2026-05-18T02:58:13Z","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":"b3f0ecef825096636d06aa0f005855252c93b5baf04c0509ea6e4e97609f2d3e","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-01-03T13:23:41Z","title_canon_sha256":"2b4d9ba613c9f5ad8f640e920895419896d24bf22406402439ddfc6a041505ec"},"schema_version":"1.0","source":{"id":"1301.0450","kind":"arxiv","version":2}},"canonical_sha256":"b8fe893764999946c3bf5ac18ee67a313025df77ed9f0a4143b1b3be81e170bc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b8fe893764999946c3bf5ac18ee67a313025df77ed9f0a4143b1b3be81e170bc","first_computed_at":"2026-05-18T02:58:13.194411Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:58:13.194411Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mj9pHjds3FM0mXCvU6o9qwfYQHSKd5lHxuhr9EO24ftzv1PwlLTq7qEHg1weudau9M2JYgoRL8rppE0SX7EcDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:58:13.195164Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.0450","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c2b1ab5d7076af65d5c5ef691dff5d1720d3820a667bccc1aadbeaaa5bbf5a22","sha256:967bbdb45153b52bfdae7af0e4c6ce331bbd9ce5642a29ab292f8ee16b3e6c18"],"state_sha256":"ff90d154c0b139c59c2719ed6ffd35c85a075b0675dfb9045bcf4fba4e95b51a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UCIbYgV9MTUuqoIeS0wO13u/JLv9yY4Oxlhy1qILQmS72OCpL5iSsRMUr/RD+CpNt+23wU0mfVeatEb+CarFDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T01:27:37.536643Z","bundle_sha256":"60bce7529221473d146fa8ffa0e445570a4af52162a78c032e74111739cc609e"}}