{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:SEAN7LM5I4MS7ANYNPQF3D4WHS","short_pith_number":"pith:SEAN7LM5","schema_version":"1.0","canonical_sha256":"9100dfad9d47192f81b86be05d8f963c906ba3058824d1a74b3e0ca22453e6fd","source":{"kind":"arxiv","id":"1406.5376","version":1},"attestation_state":"computed","paper":{"title":"Proper Hamiltonian Paths in Edge-Coloured Multigraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Gervais Mendy, Leandro Montero, Marina Groshaus, Raquel \\'Agueda, Valentin Borozan, Yannis Manoussakis","submitted_at":"2014-06-20T13:21:58Z","abstract_excerpt":"Given a $c$-edge-coloured multigraph, a proper Hamiltonian path is a path that contains all the vertices of the multigraph such that no two adjacent edges have the same colour. In this work we establish sufficient conditions for an edge-coloured multigraph to guarantee the existence of a proper Hamiltonian path, involving various parameters as the number of edges, the number of colours, the rainbow degree and the connectivity."},"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":"1406.5376","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-06-20T13:21:58Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"56f95c5ed6595c8418b2fec9171c91be1ab3002d2b2e781c45427339932c9e89","abstract_canon_sha256":"7cf45cfd99fd1b67b998ae66602df84ae67e8ed9765f579a718ce56ebb530734"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:49:19.240964Z","signature_b64":"08eh6kvc9Qz3dWC9mBICrydsgf33OGt/XgAabJN0lGMi5aJEYc7kZm65SCWXbtipe280bigWrPLlwW1bhF/zCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9100dfad9d47192f81b86be05d8f963c906ba3058824d1a74b3e0ca22453e6fd","last_reissued_at":"2026-05-18T02:49:19.240371Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:49:19.240371Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Proper Hamiltonian Paths in Edge-Coloured Multigraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Gervais Mendy, Leandro Montero, Marina Groshaus, Raquel \\'Agueda, Valentin Borozan, Yannis Manoussakis","submitted_at":"2014-06-20T13:21:58Z","abstract_excerpt":"Given a $c$-edge-coloured multigraph, a proper Hamiltonian path is a path that contains all the vertices of the multigraph such that no two adjacent edges have the same colour. In this work we establish sufficient conditions for an edge-coloured multigraph to guarantee the existence of a proper Hamiltonian path, involving various parameters as the number of edges, the number of colours, the rainbow degree and the connectivity."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.5376","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1406.5376","created_at":"2026-05-18T02:49:19.240451+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.5376v1","created_at":"2026-05-18T02:49:19.240451+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.5376","created_at":"2026-05-18T02:49:19.240451+00:00"},{"alias_kind":"pith_short_12","alias_value":"SEAN7LM5I4MS","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_16","alias_value":"SEAN7LM5I4MS7ANY","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_8","alias_value":"SEAN7LM5","created_at":"2026-05-18T12:28:49.207871+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/SEAN7LM5I4MS7ANYNPQF3D4WHS","json":"https://pith.science/pith/SEAN7LM5I4MS7ANYNPQF3D4WHS.json","graph_json":"https://pith.science/api/pith-number/SEAN7LM5I4MS7ANYNPQF3D4WHS/graph.json","events_json":"https://pith.science/api/pith-number/SEAN7LM5I4MS7ANYNPQF3D4WHS/events.json","paper":"https://pith.science/paper/SEAN7LM5"},"agent_actions":{"view_html":"https://pith.science/pith/SEAN7LM5I4MS7ANYNPQF3D4WHS","download_json":"https://pith.science/pith/SEAN7LM5I4MS7ANYNPQF3D4WHS.json","view_paper":"https://pith.science/paper/SEAN7LM5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.5376&json=true","fetch_graph":"https://pith.science/api/pith-number/SEAN7LM5I4MS7ANYNPQF3D4WHS/graph.json","fetch_events":"https://pith.science/api/pith-number/SEAN7LM5I4MS7ANYNPQF3D4WHS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SEAN7LM5I4MS7ANYNPQF3D4WHS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SEAN7LM5I4MS7ANYNPQF3D4WHS/action/storage_attestation","attest_author":"https://pith.science/pith/SEAN7LM5I4MS7ANYNPQF3D4WHS/action/author_attestation","sign_citation":"https://pith.science/pith/SEAN7LM5I4MS7ANYNPQF3D4WHS/action/citation_signature","submit_replication":"https://pith.science/pith/SEAN7LM5I4MS7ANYNPQF3D4WHS/action/replication_record"}},"created_at":"2026-05-18T02:49:19.240451+00:00","updated_at":"2026-05-18T02:49:19.240451+00:00"}