{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:3NB22SK6IFAZTFITQT7PKU43NZ","short_pith_number":"pith:3NB22SK6","canonical_record":{"source":{"id":"1604.08851","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-04-29T14:31:41Z","cross_cats_sorted":[],"title_canon_sha256":"92b06bfb8d8d8c7e0391faefd46f691302adbb06a57f84968dde7b2965b5c49b","abstract_canon_sha256":"2c31c412aa477e2ddb290db464bbf7fb62ce34817d3644d862ba43b630a83eff"},"schema_version":"1.0"},"canonical_sha256":"db43ad495e414199951384fef5539b6e7ed0eaa51d54a8445f4a59d697bc688c","source":{"kind":"arxiv","id":"1604.08851","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.08851","created_at":"2026-05-18T01:16:01Z"},{"alias_kind":"arxiv_version","alias_value":"1604.08851v1","created_at":"2026-05-18T01:16:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.08851","created_at":"2026-05-18T01:16:01Z"},{"alias_kind":"pith_short_12","alias_value":"3NB22SK6IFAZ","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"3NB22SK6IFAZTFIT","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"3NB22SK6","created_at":"2026-05-18T12:29:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:3NB22SK6IFAZTFITQT7PKU43NZ","target":"record","payload":{"canonical_record":{"source":{"id":"1604.08851","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-04-29T14:31:41Z","cross_cats_sorted":[],"title_canon_sha256":"92b06bfb8d8d8c7e0391faefd46f691302adbb06a57f84968dde7b2965b5c49b","abstract_canon_sha256":"2c31c412aa477e2ddb290db464bbf7fb62ce34817d3644d862ba43b630a83eff"},"schema_version":"1.0"},"canonical_sha256":"db43ad495e414199951384fef5539b6e7ed0eaa51d54a8445f4a59d697bc688c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:01.584379Z","signature_b64":"rXEy8hovB0J/LTAkJkQouM/xEN4ZvWxFTApY0DOGCuPJTNX3pC+e8K+ZjkFa2Z5Z5gyhVidacLN6HLX+TCvaDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"db43ad495e414199951384fef5539b6e7ed0eaa51d54a8445f4a59d697bc688c","last_reissued_at":"2026-05-18T01:16:01.583884Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:01.583884Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.08851","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:16:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DPQnQ6T5/85cj9+m+GEt2vG0JZTWwWfKriuP1g7c2WNYc2ns01Kb1/6xMzHLgb6OubV7ItzrpXEYBx0kMdVBBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T02:35:43.376934Z"},"content_sha256":"f0ef5a845307b52a7e8ceb62e0e5838d95c44f646ce3dd0fe50e8e69807a21cd","schema_version":"1.0","event_id":"sha256:f0ef5a845307b52a7e8ceb62e0e5838d95c44f646ce3dd0fe50e8e69807a21cd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:3NB22SK6IFAZTFITQT7PKU43NZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Odd Properly Colored Cycles in Edge-Colored Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bin Sheng, Gregory Gutin, Magnus Wahlstr\\\"om","submitted_at":"2016-04-29T14:31:41Z","abstract_excerpt":"It is well-known that an undirected graph has no odd cycle if and only if it is bipartite. A less obvious, but similar result holds for directed graphs: a strongly connected digraph has no odd cycle if and only if it is bipartite. Can this result be further generalized to more general graphs such as edge-colored graphs? In this paper, we study this problem and show how to decide if there exists an odd properly colored cycle in a given edge-colored graph. As a by-product, we show how to detect if there is a perfect matching in a graph with even (or odd) number of edges in a given edge set."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.08851","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:16:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EOcK8tM6EKc5vOJMo9DRy8v80zt9VLRB0jOGNTr4H3HNkpOoD4Ir289iRG/5zi0jTTTtrpvEH8Ei/u12m9UDCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T02:35:43.377439Z"},"content_sha256":"d0191694e6e13fb6a8d81c9849b2c841cf6f8f48db74404e071e1ba1f060ddf7","schema_version":"1.0","event_id":"sha256:d0191694e6e13fb6a8d81c9849b2c841cf6f8f48db74404e071e1ba1f060ddf7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3NB22SK6IFAZTFITQT7PKU43NZ/bundle.json","state_url":"https://pith.science/pith/3NB22SK6IFAZTFITQT7PKU43NZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3NB22SK6IFAZTFITQT7PKU43NZ/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-05-31T02:35:43Z","links":{"resolver":"https://pith.science/pith/3NB22SK6IFAZTFITQT7PKU43NZ","bundle":"https://pith.science/pith/3NB22SK6IFAZTFITQT7PKU43NZ/bundle.json","state":"https://pith.science/pith/3NB22SK6IFAZTFITQT7PKU43NZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3NB22SK6IFAZTFITQT7PKU43NZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:3NB22SK6IFAZTFITQT7PKU43NZ","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":"2c31c412aa477e2ddb290db464bbf7fb62ce34817d3644d862ba43b630a83eff","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-04-29T14:31:41Z","title_canon_sha256":"92b06bfb8d8d8c7e0391faefd46f691302adbb06a57f84968dde7b2965b5c49b"},"schema_version":"1.0","source":{"id":"1604.08851","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.08851","created_at":"2026-05-18T01:16:01Z"},{"alias_kind":"arxiv_version","alias_value":"1604.08851v1","created_at":"2026-05-18T01:16:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.08851","created_at":"2026-05-18T01:16:01Z"},{"alias_kind":"pith_short_12","alias_value":"3NB22SK6IFAZ","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"3NB22SK6IFAZTFIT","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"3NB22SK6","created_at":"2026-05-18T12:29:55Z"}],"graph_snapshots":[{"event_id":"sha256:d0191694e6e13fb6a8d81c9849b2c841cf6f8f48db74404e071e1ba1f060ddf7","target":"graph","created_at":"2026-05-18T01:16:01Z","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":"It is well-known that an undirected graph has no odd cycle if and only if it is bipartite. A less obvious, but similar result holds for directed graphs: a strongly connected digraph has no odd cycle if and only if it is bipartite. Can this result be further generalized to more general graphs such as edge-colored graphs? In this paper, we study this problem and show how to decide if there exists an odd properly colored cycle in a given edge-colored graph. As a by-product, we show how to detect if there is a perfect matching in a graph with even (or odd) number of edges in a given edge set.","authors_text":"Bin Sheng, Gregory Gutin, Magnus Wahlstr\\\"om","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-04-29T14:31:41Z","title":"Odd Properly Colored Cycles in Edge-Colored Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.08851","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:f0ef5a845307b52a7e8ceb62e0e5838d95c44f646ce3dd0fe50e8e69807a21cd","target":"record","created_at":"2026-05-18T01:16:01Z","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":"2c31c412aa477e2ddb290db464bbf7fb62ce34817d3644d862ba43b630a83eff","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-04-29T14:31:41Z","title_canon_sha256":"92b06bfb8d8d8c7e0391faefd46f691302adbb06a57f84968dde7b2965b5c49b"},"schema_version":"1.0","source":{"id":"1604.08851","kind":"arxiv","version":1}},"canonical_sha256":"db43ad495e414199951384fef5539b6e7ed0eaa51d54a8445f4a59d697bc688c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"db43ad495e414199951384fef5539b6e7ed0eaa51d54a8445f4a59d697bc688c","first_computed_at":"2026-05-18T01:16:01.583884Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:16:01.583884Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rXEy8hovB0J/LTAkJkQouM/xEN4ZvWxFTApY0DOGCuPJTNX3pC+e8K+ZjkFa2Z5Z5gyhVidacLN6HLX+TCvaDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:16:01.584379Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.08851","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f0ef5a845307b52a7e8ceb62e0e5838d95c44f646ce3dd0fe50e8e69807a21cd","sha256:d0191694e6e13fb6a8d81c9849b2c841cf6f8f48db74404e071e1ba1f060ddf7"],"state_sha256":"8d8515619ee1c7cf28fbf8fc7023d2a4c8893be1bcdccaee656633663d075401"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PoRq+gl8LXBDZqWCbtvo31Ei0AYksGAgocAo5Yu1memowfcRmRgeoBbtkX3kcFIwLt+s0+ISLSyR4+qQ7lDNCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T02:35:43.380929Z","bundle_sha256":"d425809c5c96f73b418702d0176e825c2d5640bfcde1e17de15600453c35efb1"}}