{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:DS4IB4FZ7HWAK6XOTPRAQ53BWK","short_pith_number":"pith:DS4IB4FZ","schema_version":"1.0","canonical_sha256":"1cb880f0b9f9ec057aee9be2087761b2a679457a17bbb4504c7d072a9d8d3cc1","source":{"kind":"arxiv","id":"1503.03390","version":1},"attestation_state":"computed","paper":{"title":"Jacobsthal numbers in generalised Petersen graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Henning Bruhn, Jacob G\\\"unther, Laura Gellert","submitted_at":"2015-03-11T15:52:30Z","abstract_excerpt":"We prove that the number of $1$-factorisations of a generalised Petersen graph of the type $GP(3k,k)$ is equal to the $k$th Jacobsthal number $J(k)$ if $k$ is odd, and equal to $4J(k)$, when $k$ is even. Moreover, we verify the list colouring conjecture for $GP(3k,k)$."},"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":"1503.03390","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-11T15:52:30Z","cross_cats_sorted":[],"title_canon_sha256":"d446cc4a9c9fc36806267b624476350680aee272e19409785e98bed2f804a32c","abstract_canon_sha256":"68b8911c7f5356f0ed35c19751637800a69964f1114415316307319e74470b4a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:25:03.713452Z","signature_b64":"zcbyCM7q5FP8UOYNlQD5T3r904PLflFMLiQU+hJdMAFWh/0B/U+9Qej0719fuFSij6HXcYe6JN1aAPOIWR1/Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1cb880f0b9f9ec057aee9be2087761b2a679457a17bbb4504c7d072a9d8d3cc1","last_reissued_at":"2026-05-18T02:25:03.713068Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:25:03.713068Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Jacobsthal numbers in generalised Petersen graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Henning Bruhn, Jacob G\\\"unther, Laura Gellert","submitted_at":"2015-03-11T15:52:30Z","abstract_excerpt":"We prove that the number of $1$-factorisations of a generalised Petersen graph of the type $GP(3k,k)$ is equal to the $k$th Jacobsthal number $J(k)$ if $k$ is odd, and equal to $4J(k)$, when $k$ is even. Moreover, we verify the list colouring conjecture for $GP(3k,k)$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.03390","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":"1503.03390","created_at":"2026-05-18T02:25:03.713122+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.03390v1","created_at":"2026-05-18T02:25:03.713122+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.03390","created_at":"2026-05-18T02:25:03.713122+00:00"},{"alias_kind":"pith_short_12","alias_value":"DS4IB4FZ7HWA","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_16","alias_value":"DS4IB4FZ7HWAK6XO","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_8","alias_value":"DS4IB4FZ","created_at":"2026-05-18T12:29:17.054201+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/DS4IB4FZ7HWAK6XOTPRAQ53BWK","json":"https://pith.science/pith/DS4IB4FZ7HWAK6XOTPRAQ53BWK.json","graph_json":"https://pith.science/api/pith-number/DS4IB4FZ7HWAK6XOTPRAQ53BWK/graph.json","events_json":"https://pith.science/api/pith-number/DS4IB4FZ7HWAK6XOTPRAQ53BWK/events.json","paper":"https://pith.science/paper/DS4IB4FZ"},"agent_actions":{"view_html":"https://pith.science/pith/DS4IB4FZ7HWAK6XOTPRAQ53BWK","download_json":"https://pith.science/pith/DS4IB4FZ7HWAK6XOTPRAQ53BWK.json","view_paper":"https://pith.science/paper/DS4IB4FZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.03390&json=true","fetch_graph":"https://pith.science/api/pith-number/DS4IB4FZ7HWAK6XOTPRAQ53BWK/graph.json","fetch_events":"https://pith.science/api/pith-number/DS4IB4FZ7HWAK6XOTPRAQ53BWK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DS4IB4FZ7HWAK6XOTPRAQ53BWK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DS4IB4FZ7HWAK6XOTPRAQ53BWK/action/storage_attestation","attest_author":"https://pith.science/pith/DS4IB4FZ7HWAK6XOTPRAQ53BWK/action/author_attestation","sign_citation":"https://pith.science/pith/DS4IB4FZ7HWAK6XOTPRAQ53BWK/action/citation_signature","submit_replication":"https://pith.science/pith/DS4IB4FZ7HWAK6XOTPRAQ53BWK/action/replication_record"}},"created_at":"2026-05-18T02:25:03.713122+00:00","updated_at":"2026-05-18T02:25:03.713122+00:00"}