{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:4PMPFU6QLHEGJATEOJQNNJEFLA","short_pith_number":"pith:4PMPFU6Q","schema_version":"1.0","canonical_sha256":"e3d8f2d3d059c86482647260d6a48558165106d57fdc974fb3485661f2246a3d","source":{"kind":"arxiv","id":"1807.00109","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1807.00109","created_at":"2026-05-17T23:48:43.427053+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.00109v2","created_at":"2026-05-17T23:48:43.427053+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.00109","created_at":"2026-05-17T23:48:43.427053+00:00"},{"alias_kind":"pith_short_12","alias_value":"4PMPFU6QLHEG","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_16","alias_value":"4PMPFU6QLHEGJATE","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_8","alias_value":"4PMPFU6Q","created_at":"2026-05-18T12:32:05.422762+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/4PMPFU6QLHEGJATEOJQNNJEFLA","json":"https://pith.science/pith/4PMPFU6QLHEGJATEOJQNNJEFLA.json","graph_json":"https://pith.science/api/pith-number/4PMPFU6QLHEGJATEOJQNNJEFLA/graph.json","events_json":"https://pith.science/api/pith-number/4PMPFU6QLHEGJATEOJQNNJEFLA/events.json","paper":"https://pith.science/paper/4PMPFU6Q"},"agent_actions":{"view_html":"https://pith.science/pith/4PMPFU6QLHEGJATEOJQNNJEFLA","download_json":"https://pith.science/pith/4PMPFU6QLHEGJATEOJQNNJEFLA.json","view_paper":"https://pith.science/paper/4PMPFU6Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.00109&json=true","fetch_graph":"https://pith.science/api/pith-number/4PMPFU6QLHEGJATEOJQNNJEFLA/graph.json","fetch_events":"https://pith.science/api/pith-number/4PMPFU6QLHEGJATEOJQNNJEFLA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4PMPFU6QLHEGJATEOJQNNJEFLA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4PMPFU6QLHEGJATEOJQNNJEFLA/action/storage_attestation","attest_author":"https://pith.science/pith/4PMPFU6QLHEGJATEOJQNNJEFLA/action/author_attestation","sign_citation":"https://pith.science/pith/4PMPFU6QLHEGJATEOJQNNJEFLA/action/citation_signature","submit_replication":"https://pith.science/pith/4PMPFU6QLHEGJATEOJQNNJEFLA/action/replication_record"}},"created_at":"2026-05-17T23:48:43.427053+00:00","updated_at":"2026-05-17T23:48:43.427053+00:00"}