{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:3JIJND7FKX4PTHLR2B3RD7IQTM","short_pith_number":"pith:3JIJND7F","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"},"canonical_sha256":"da50968fe555f8f99d71d07711fd109b240b2942f2ebf9739ecb6f53505508e6","source":{"kind":"arxiv","id":"1705.03675","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.03675","created_at":"2026-05-17T23:47:03Z"},{"alias_kind":"arxiv_version","alias_value":"1705.03675v2","created_at":"2026-05-17T23:47:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.03675","created_at":"2026-05-17T23:47:03Z"},{"alias_kind":"pith_short_12","alias_value":"3JIJND7FKX4P","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"3JIJND7FKX4PTHLR","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"3JIJND7F","created_at":"2026-05-18T12:30:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:3JIJND7FKX4PTHLR2B3RD7IQTM","target":"record","payload":{"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"},"canonical_sha256":"da50968fe555f8f99d71d07711fd109b240b2942f2ebf9739ecb6f53505508e6","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"},"source_kind":"arxiv","source_id":"1705.03675","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-17T23:47:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Oxg9Cz34odtBMMrIS5hSyRhm1XBJ/MZ3SVNnc/ZGVeIi4GTCr+jSuTeO4taGXw3LlrEwZgh5RUjhdQ8W5xycDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T19:01:05.419664Z"},"content_sha256":"c7d0de0efa19242ca7c7318f712163589498a4fd4d536f2655659c056742d167","schema_version":"1.0","event_id":"sha256:c7d0de0efa19242ca7c7318f712163589498a4fd4d536f2655659c056742d167"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:3JIJND7FKX4PTHLR2B3RD7IQTM","target":"graph","payload":{"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"},"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-17T23:47:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BjZ5/6NaF8XYqTadjj1WbHXtKNRA9a6jQqTq9Ktg++hqcsFdiO0P7iPKQbq9tw6gZFvQO5uv7STWLTL5eXNJBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T19:01:05.420014Z"},"content_sha256":"136d71319a882cd7f2442e35546e5f9b082106c7bd501d1552b7120d00e2646e","schema_version":"1.0","event_id":"sha256:136d71319a882cd7f2442e35546e5f9b082106c7bd501d1552b7120d00e2646e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3JIJND7FKX4PTHLR2B3RD7IQTM/bundle.json","state_url":"https://pith.science/pith/3JIJND7FKX4PTHLR2B3RD7IQTM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3JIJND7FKX4PTHLR2B3RD7IQTM/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-04T19:01:05Z","links":{"resolver":"https://pith.science/pith/3JIJND7FKX4PTHLR2B3RD7IQTM","bundle":"https://pith.science/pith/3JIJND7FKX4PTHLR2B3RD7IQTM/bundle.json","state":"https://pith.science/pith/3JIJND7FKX4PTHLR2B3RD7IQTM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3JIJND7FKX4PTHLR2B3RD7IQTM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:3JIJND7FKX4PTHLR2B3RD7IQTM","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":"e1f1ee8a51f9751236679a40997eec00126c7c75c3591bbac9edc41c3a02ea4c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-10T09:43:53Z","title_canon_sha256":"cb6e609123da23a18fe039159d4f859b99d8e9b0a720d32e39c14499fbcd2616"},"schema_version":"1.0","source":{"id":"1705.03675","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.03675","created_at":"2026-05-17T23:47:03Z"},{"alias_kind":"arxiv_version","alias_value":"1705.03675v2","created_at":"2026-05-17T23:47:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.03675","created_at":"2026-05-17T23:47:03Z"},{"alias_kind":"pith_short_12","alias_value":"3JIJND7FKX4P","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"3JIJND7FKX4PTHLR","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"3JIJND7F","created_at":"2026-05-18T12:30:58Z"}],"graph_snapshots":[{"event_id":"sha256:136d71319a882cd7f2442e35546e5f9b082106c7bd501d1552b7120d00e2646e","target":"graph","created_at":"2026-05-17T23:47:03Z","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 $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","authors_text":"Bo Ning, Chuandong Xu, Shenggui Zhang, Shinya Fujita","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-10T09:43:53Z","title":"On sufficient conditions for rainbow cycles in edge-colored graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.03675","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:c7d0de0efa19242ca7c7318f712163589498a4fd4d536f2655659c056742d167","target":"record","created_at":"2026-05-17T23:47:03Z","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":"e1f1ee8a51f9751236679a40997eec00126c7c75c3591bbac9edc41c3a02ea4c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-10T09:43:53Z","title_canon_sha256":"cb6e609123da23a18fe039159d4f859b99d8e9b0a720d32e39c14499fbcd2616"},"schema_version":"1.0","source":{"id":"1705.03675","kind":"arxiv","version":2}},"canonical_sha256":"da50968fe555f8f99d71d07711fd109b240b2942f2ebf9739ecb6f53505508e6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"da50968fe555f8f99d71d07711fd109b240b2942f2ebf9739ecb6f53505508e6","first_computed_at":"2026-05-17T23:47:03.887268Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:03.887268Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cGNmxHNECS/zqQvGgTDK+v5qfzuya7gHu/CB7qpytWsVYPne07T/ZyQrTb7lG0o+9YxZdC3ejkgC6+2RWGzDBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:03.887950Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.03675","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c7d0de0efa19242ca7c7318f712163589498a4fd4d536f2655659c056742d167","sha256:136d71319a882cd7f2442e35546e5f9b082106c7bd501d1552b7120d00e2646e"],"state_sha256":"9872b6bd7c362f9ec7be328177997ad4443e06f9cba0a8013905c6d5ce65ff9f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZcV53jFMuE8TbTLY2rt54dBNavIgM22oVUx85RVjoTJ9fWONzAaOxCRmmvVdm/2dmTJRJUMhp2dmd5lrNrUoCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T19:01:05.421944Z","bundle_sha256":"d847965cecc8713598c16358ef19089f8b6ecd8a93c4bd17b1ca9dd8ac66bb59"}}