{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:3JIJND7FKX4PTHLR2B3RD7IQTM","short_pith_number":"pith:3JIJND7F","schema_version":"1.0","canonical_sha256":"da50968fe555f8f99d71d07711fd109b240b2942f2ebf9739ecb6f53505508e6","source":{"kind":"arxiv","id":"1705.03675","version":2},"attestation_state":"computed","paper":{"title":"On sufficient conditions for rainbow cycles in edge-colored graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bo Ning, Chuandong Xu, Shenggui Zhang, Shinya Fujita","submitted_at":"2017-05-10T09:43:53Z","abstract_excerpt":"Let $G$ be an edge-colored graph. We use $e(G)$ and $c(G)$ to denote the number of edges of $G$ and the number of colors appearing on $E(G)$, respectively. For a vertex $v\\in V(G)$, the \\emph{color neighborhood} of $v$ is defined as the set of colors assigned to the edges incident to $v$. A subgraph of $G$ is \\emph{rainbow} if all of its edges are assigned with distinct colors. The well-known Mantel's theorem states that a graph $G$ on $n$ vertices contains a triangle if $e(G)\\geq\\lfloor\\frac{n^2}{4}\\rfloor+1$. Rademacher (1941) showed that $G$ contains at least $\\lfloor\\frac{n}{2}\\rfloor$ tri"},"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":"1705.03675","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-10T09:43:53Z","cross_cats_sorted":[],"title_canon_sha256":"cb6e609123da23a18fe039159d4f859b99d8e9b0a720d32e39c14499fbcd2616","abstract_canon_sha256":"e1f1ee8a51f9751236679a40997eec00126c7c75c3591bbac9edc41c3a02ea4c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:03.887950Z","signature_b64":"cGNmxHNECS/zqQvGgTDK+v5qfzuya7gHu/CB7qpytWsVYPne07T/ZyQrTb7lG0o+9YxZdC3ejkgC6+2RWGzDBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"da50968fe555f8f99d71d07711fd109b240b2942f2ebf9739ecb6f53505508e6","last_reissued_at":"2026-05-17T23:47:03.887268Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:03.887268Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On sufficient conditions for rainbow cycles in edge-colored graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bo Ning, Chuandong Xu, Shenggui Zhang, Shinya Fujita","submitted_at":"2017-05-10T09:43:53Z","abstract_excerpt":"Let $G$ be an edge-colored graph. We use $e(G)$ and $c(G)$ to denote the number of edges of $G$ and the number of colors appearing on $E(G)$, respectively. For a vertex $v\\in V(G)$, the \\emph{color neighborhood} of $v$ is defined as the set of colors assigned to the edges incident to $v$. A subgraph of $G$ is \\emph{rainbow} if all of its edges are assigned with distinct colors. The well-known Mantel's theorem states that a graph $G$ on $n$ vertices contains a triangle if $e(G)\\geq\\lfloor\\frac{n^2}{4}\\rfloor+1$. Rademacher (1941) showed that $G$ contains at least $\\lfloor\\frac{n}{2}\\rfloor$ tri"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.03675","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":"1705.03675","created_at":"2026-05-17T23:47:03.887367+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.03675v2","created_at":"2026-05-17T23:47:03.887367+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.03675","created_at":"2026-05-17T23:47:03.887367+00:00"},{"alias_kind":"pith_short_12","alias_value":"3JIJND7FKX4P","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_16","alias_value":"3JIJND7FKX4PTHLR","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_8","alias_value":"3JIJND7F","created_at":"2026-05-18T12:30:58.224056+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/3JIJND7FKX4PTHLR2B3RD7IQTM","json":"https://pith.science/pith/3JIJND7FKX4PTHLR2B3RD7IQTM.json","graph_json":"https://pith.science/api/pith-number/3JIJND7FKX4PTHLR2B3RD7IQTM/graph.json","events_json":"https://pith.science/api/pith-number/3JIJND7FKX4PTHLR2B3RD7IQTM/events.json","paper":"https://pith.science/paper/3JIJND7F"},"agent_actions":{"view_html":"https://pith.science/pith/3JIJND7FKX4PTHLR2B3RD7IQTM","download_json":"https://pith.science/pith/3JIJND7FKX4PTHLR2B3RD7IQTM.json","view_paper":"https://pith.science/paper/3JIJND7F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.03675&json=true","fetch_graph":"https://pith.science/api/pith-number/3JIJND7FKX4PTHLR2B3RD7IQTM/graph.json","fetch_events":"https://pith.science/api/pith-number/3JIJND7FKX4PTHLR2B3RD7IQTM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3JIJND7FKX4PTHLR2B3RD7IQTM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3JIJND7FKX4PTHLR2B3RD7IQTM/action/storage_attestation","attest_author":"https://pith.science/pith/3JIJND7FKX4PTHLR2B3RD7IQTM/action/author_attestation","sign_citation":"https://pith.science/pith/3JIJND7FKX4PTHLR2B3RD7IQTM/action/citation_signature","submit_replication":"https://pith.science/pith/3JIJND7FKX4PTHLR2B3RD7IQTM/action/replication_record"}},"created_at":"2026-05-17T23:47:03.887367+00:00","updated_at":"2026-05-17T23:47:03.887367+00:00"}