{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:IR2RUWQEGDB65BSSFNTC3CGRQD","short_pith_number":"pith:IR2RUWQE","schema_version":"1.0","canonical_sha256":"44751a5a0430c3ee86522b662d88d180fd9fdfa700d7560ad4a4bd756ce68215","source":{"kind":"arxiv","id":"1512.05944","version":2},"attestation_state":"computed","paper":{"title":"Generation of cubic graphs and snarks with large girth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Gunnar Brinkmann, Jan Goedgebeur","submitted_at":"2015-12-18T13:31:18Z","abstract_excerpt":"We describe two new algorithms for the generation of all non-isomorphic cubic graphs with girth at least $k\\ge 5$ which are very efficient for $5\\le k \\le 7$ and show how these algorithms can be efficiently restricted to generate snarks with girth at least $k$.\n  Our implementation of these algorithms is more than 30, respectively 40 times faster than the previously fastest generator for cubic graphs with girth at least 6 and 7, respectively.\n  Using these generators we have also generated all non-isomorphic snarks with girth at least 6 up to 38 vertices and show that there are no snarks with "},"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":"1512.05944","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-12-18T13:31:18Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"179c1918ab558a864abde5f2d86cddaffee004f54b5e646acd3ca47b06ee2bd9","abstract_canon_sha256":"4bc70bbf85e2f1f4b1e21fa92b34b61186c8523eb6eaf4b4da82679bc35e130d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:42.139682Z","signature_b64":"tZOMAAFLKJ6GTV6R1LQx3MD+yb7eJAu5r+QYheYiLOvn/bDUb1rTneUrFjJ2clN9n1FPHjmJBSZ3ZysbLBMQCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"44751a5a0430c3ee86522b662d88d180fd9fdfa700d7560ad4a4bd756ce68215","last_reissued_at":"2026-05-18T00:41:42.139018Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:42.139018Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generation of cubic graphs and snarks with large girth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Gunnar Brinkmann, Jan Goedgebeur","submitted_at":"2015-12-18T13:31:18Z","abstract_excerpt":"We describe two new algorithms for the generation of all non-isomorphic cubic graphs with girth at least $k\\ge 5$ which are very efficient for $5\\le k \\le 7$ and show how these algorithms can be efficiently restricted to generate snarks with girth at least $k$.\n  Our implementation of these algorithms is more than 30, respectively 40 times faster than the previously fastest generator for cubic graphs with girth at least 6 and 7, respectively.\n  Using these generators we have also generated all non-isomorphic snarks with girth at least 6 up to 38 vertices and show that there are no snarks with "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.05944","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":"1512.05944","created_at":"2026-05-18T00:41:42.139120+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.05944v2","created_at":"2026-05-18T00:41:42.139120+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.05944","created_at":"2026-05-18T00:41:42.139120+00:00"},{"alias_kind":"pith_short_12","alias_value":"IR2RUWQEGDB6","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_16","alias_value":"IR2RUWQEGDB65BSS","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_8","alias_value":"IR2RUWQE","created_at":"2026-05-18T12:29:25.134429+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/IR2RUWQEGDB65BSSFNTC3CGRQD","json":"https://pith.science/pith/IR2RUWQEGDB65BSSFNTC3CGRQD.json","graph_json":"https://pith.science/api/pith-number/IR2RUWQEGDB65BSSFNTC3CGRQD/graph.json","events_json":"https://pith.science/api/pith-number/IR2RUWQEGDB65BSSFNTC3CGRQD/events.json","paper":"https://pith.science/paper/IR2RUWQE"},"agent_actions":{"view_html":"https://pith.science/pith/IR2RUWQEGDB65BSSFNTC3CGRQD","download_json":"https://pith.science/pith/IR2RUWQEGDB65BSSFNTC3CGRQD.json","view_paper":"https://pith.science/paper/IR2RUWQE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.05944&json=true","fetch_graph":"https://pith.science/api/pith-number/IR2RUWQEGDB65BSSFNTC3CGRQD/graph.json","fetch_events":"https://pith.science/api/pith-number/IR2RUWQEGDB65BSSFNTC3CGRQD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IR2RUWQEGDB65BSSFNTC3CGRQD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IR2RUWQEGDB65BSSFNTC3CGRQD/action/storage_attestation","attest_author":"https://pith.science/pith/IR2RUWQEGDB65BSSFNTC3CGRQD/action/author_attestation","sign_citation":"https://pith.science/pith/IR2RUWQEGDB65BSSFNTC3CGRQD/action/citation_signature","submit_replication":"https://pith.science/pith/IR2RUWQEGDB65BSSFNTC3CGRQD/action/replication_record"}},"created_at":"2026-05-18T00:41:42.139120+00:00","updated_at":"2026-05-18T00:41:42.139120+00:00"}