{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:4PMPFU6QLHEGJATEOJQNNJEFLA","short_pith_number":"pith:4PMPFU6Q","canonical_record":{"source":{"id":"1807.00109","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-06-30T02:18:39Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"3632b066aef1e93a1de39884aab34865f3550c0d87b850b86bd2a750b5dfd5df","abstract_canon_sha256":"7a5c47c12685aec8cc5ebef537778eef8e5450ace1f0ac0ee1e29f4f31c989f5"},"schema_version":"1.0"},"canonical_sha256":"e3d8f2d3d059c86482647260d6a48558165106d57fdc974fb3485661f2246a3d","source":{"kind":"arxiv","id":"1807.00109","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.00109","created_at":"2026-05-17T23:48:43Z"},{"alias_kind":"arxiv_version","alias_value":"1807.00109v2","created_at":"2026-05-17T23:48:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.00109","created_at":"2026-05-17T23:48:43Z"},{"alias_kind":"pith_short_12","alias_value":"4PMPFU6QLHEG","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"4PMPFU6QLHEGJATE","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"4PMPFU6Q","created_at":"2026-05-18T12:32:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:4PMPFU6QLHEGJATEOJQNNJEFLA","target":"record","payload":{"canonical_record":{"source":{"id":"1807.00109","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-06-30T02:18:39Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"3632b066aef1e93a1de39884aab34865f3550c0d87b850b86bd2a750b5dfd5df","abstract_canon_sha256":"7a5c47c12685aec8cc5ebef537778eef8e5450ace1f0ac0ee1e29f4f31c989f5"},"schema_version":"1.0"},"canonical_sha256":"e3d8f2d3d059c86482647260d6a48558165106d57fdc974fb3485661f2246a3d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:43.427524Z","signature_b64":"/ZPSlkHFwRcBhmI/uk4X7yp3ZPJgI/+CNiPVrFsjKG4VbsjEdMjEf/ua3m7yPNODre7N5I9amKFr8Ftdfh4mBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e3d8f2d3d059c86482647260d6a48558165106d57fdc974fb3485661f2246a3d","last_reissued_at":"2026-05-17T23:48:43.426980Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:43.426980Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.00109","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:48:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2v+ttNrd7jdy3SvpwLku/vvDXvHt0C02yq1e2VqFiGLdgzl2JQuigcbwETRfMwkVHDJwK2iZP3TVTF58/6T3Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T03:36:22.249589Z"},"content_sha256":"abf335acbb846a996431e8a62876e5e37f4468c08ef6422824a2ed0c301ec5f6","schema_version":"1.0","event_id":"sha256:abf335acbb846a996431e8a62876e5e37f4468c08ef6422824a2ed0c301ec5f6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:4PMPFU6QLHEGJATEOJQNNJEFLA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Finding a Path with Two Labels Forbidden in Group-Labeled Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Yasushi Kawase, Yusuke Kobayashi, Yutaro Yamaguchi","submitted_at":"2018-06-30T02:18:39Z","abstract_excerpt":"The parity of the length of paths and cycles is a classical and well-studied topic in graph theory and theoretical computer science. The parity constraints can be extended to label constraints in a group-labeled graph, which is a directed graph with each arc labeled by an element of a group. Recently, paths and cycles in group-labeled graphs have been investigated, such as packing non-zero paths and cycles, where \"non-zero\" means that the identity element is a unique forbidden label.\n  In this paper, we present a solution to finding an $s$--$t$ path with two labels forbidden in a group-labeled"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.00109","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:48:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ulmZhTnPLg3jFAEwQllgw6RzcyTGotd6MzLri4yaQa3fXRzAcHJlzcq2kMk+/tio4aY8LnnTFgFwGoPuFxNtBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T03:36:22.249929Z"},"content_sha256":"f98fc025d7c98c8d6be2dda47d9dc18c0e8082acd5c6cf0d01fd66cb7089185b","schema_version":"1.0","event_id":"sha256:f98fc025d7c98c8d6be2dda47d9dc18c0e8082acd5c6cf0d01fd66cb7089185b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4PMPFU6QLHEGJATEOJQNNJEFLA/bundle.json","state_url":"https://pith.science/pith/4PMPFU6QLHEGJATEOJQNNJEFLA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4PMPFU6QLHEGJATEOJQNNJEFLA/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-02T03:36:22Z","links":{"resolver":"https://pith.science/pith/4PMPFU6QLHEGJATEOJQNNJEFLA","bundle":"https://pith.science/pith/4PMPFU6QLHEGJATEOJQNNJEFLA/bundle.json","state":"https://pith.science/pith/4PMPFU6QLHEGJATEOJQNNJEFLA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4PMPFU6QLHEGJATEOJQNNJEFLA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:4PMPFU6QLHEGJATEOJQNNJEFLA","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":"7a5c47c12685aec8cc5ebef537778eef8e5450ace1f0ac0ee1e29f4f31c989f5","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-06-30T02:18:39Z","title_canon_sha256":"3632b066aef1e93a1de39884aab34865f3550c0d87b850b86bd2a750b5dfd5df"},"schema_version":"1.0","source":{"id":"1807.00109","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.00109","created_at":"2026-05-17T23:48:43Z"},{"alias_kind":"arxiv_version","alias_value":"1807.00109v2","created_at":"2026-05-17T23:48:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.00109","created_at":"2026-05-17T23:48:43Z"},{"alias_kind":"pith_short_12","alias_value":"4PMPFU6QLHEG","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"4PMPFU6QLHEGJATE","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"4PMPFU6Q","created_at":"2026-05-18T12:32:05Z"}],"graph_snapshots":[{"event_id":"sha256:f98fc025d7c98c8d6be2dda47d9dc18c0e8082acd5c6cf0d01fd66cb7089185b","target":"graph","created_at":"2026-05-17T23:48:43Z","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":"The parity of the length of paths and cycles is a classical and well-studied topic in graph theory and theoretical computer science. The parity constraints can be extended to label constraints in a group-labeled graph, which is a directed graph with each arc labeled by an element of a group. Recently, paths and cycles in group-labeled graphs have been investigated, such as packing non-zero paths and cycles, where \"non-zero\" means that the identity element is a unique forbidden label.\n  In this paper, we present a solution to finding an $s$--$t$ path with two labels forbidden in a group-labeled","authors_text":"Yasushi Kawase, Yusuke Kobayashi, Yutaro Yamaguchi","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-06-30T02:18:39Z","title":"Finding a Path with Two Labels Forbidden in Group-Labeled Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.00109","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:abf335acbb846a996431e8a62876e5e37f4468c08ef6422824a2ed0c301ec5f6","target":"record","created_at":"2026-05-17T23:48:43Z","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":"7a5c47c12685aec8cc5ebef537778eef8e5450ace1f0ac0ee1e29f4f31c989f5","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-06-30T02:18:39Z","title_canon_sha256":"3632b066aef1e93a1de39884aab34865f3550c0d87b850b86bd2a750b5dfd5df"},"schema_version":"1.0","source":{"id":"1807.00109","kind":"arxiv","version":2}},"canonical_sha256":"e3d8f2d3d059c86482647260d6a48558165106d57fdc974fb3485661f2246a3d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e3d8f2d3d059c86482647260d6a48558165106d57fdc974fb3485661f2246a3d","first_computed_at":"2026-05-17T23:48:43.426980Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:48:43.426980Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/ZPSlkHFwRcBhmI/uk4X7yp3ZPJgI/+CNiPVrFsjKG4VbsjEdMjEf/ua3m7yPNODre7N5I9amKFr8Ftdfh4mBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:48:43.427524Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.00109","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:abf335acbb846a996431e8a62876e5e37f4468c08ef6422824a2ed0c301ec5f6","sha256:f98fc025d7c98c8d6be2dda47d9dc18c0e8082acd5c6cf0d01fd66cb7089185b"],"state_sha256":"f6b45cb1d9be31b9f240d9edd2c573229ce43ada4a44fd4c04f832f46027b4ea"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zJLz6UUK5Cr0AnU7FEKzxXQ/7QAAQGpPcl/YZN0jspPacCwHaGfOM83+gvtAUYxcIWwzocVQ0A4R8wBQ/kjUBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T03:36:22.251766Z","bundle_sha256":"c87cb1b6e8395c8422ccf540952f50d7e9fec0629af5f508d266ee5d451b0568"}}