{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:XD7ISN3ETGMUNQ57LLAY5ZT2GE","short_pith_number":"pith:XD7ISN3E","schema_version":"1.0","canonical_sha256":"b8fe893764999946c3bf5ac18ee67a313025df77ed9f0a4143b1b3be81e170bc","source":{"kind":"arxiv","id":"1301.0450","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1301.0450","created_at":"2026-05-18T02:58:13.194551+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.0450v2","created_at":"2026-05-18T02:58:13.194551+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.0450","created_at":"2026-05-18T02:58:13.194551+00:00"},{"alias_kind":"pith_short_12","alias_value":"XD7ISN3ETGMU","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_16","alias_value":"XD7ISN3ETGMUNQ57","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_8","alias_value":"XD7ISN3E","created_at":"2026-05-18T12:28:06.772260+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XD7ISN3ETGMUNQ57LLAY5ZT2GE","json":"https://pith.science/pith/XD7ISN3ETGMUNQ57LLAY5ZT2GE.json","graph_json":"https://pith.science/api/pith-number/XD7ISN3ETGMUNQ57LLAY5ZT2GE/graph.json","events_json":"https://pith.science/api/pith-number/XD7ISN3ETGMUNQ57LLAY5ZT2GE/events.json","paper":"https://pith.science/paper/XD7ISN3E"},"agent_actions":{"view_html":"https://pith.science/pith/XD7ISN3ETGMUNQ57LLAY5ZT2GE","download_json":"https://pith.science/pith/XD7ISN3ETGMUNQ57LLAY5ZT2GE.json","view_paper":"https://pith.science/paper/XD7ISN3E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.0450&json=true","fetch_graph":"https://pith.science/api/pith-number/XD7ISN3ETGMUNQ57LLAY5ZT2GE/graph.json","fetch_events":"https://pith.science/api/pith-number/XD7ISN3ETGMUNQ57LLAY5ZT2GE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XD7ISN3ETGMUNQ57LLAY5ZT2GE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XD7ISN3ETGMUNQ57LLAY5ZT2GE/action/storage_attestation","attest_author":"https://pith.science/pith/XD7ISN3ETGMUNQ57LLAY5ZT2GE/action/author_attestation","sign_citation":"https://pith.science/pith/XD7ISN3ETGMUNQ57LLAY5ZT2GE/action/citation_signature","submit_replication":"https://pith.science/pith/XD7ISN3ETGMUNQ57LLAY5ZT2GE/action/replication_record"}},"created_at":"2026-05-18T02:58:13.194551+00:00","updated_at":"2026-05-18T02:58:13.194551+00:00"}