{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:DHZJTSGHX6XBBMPJGGO2PBVU5P","short_pith_number":"pith:DHZJTSGH","canonical_record":{"source":{"id":"1311.0512","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-11-03T19:28:27Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"599d24c940532a8acdaba17b7462dd0ea2d3e4b85c5f1dbf90e74a24cd229db3","abstract_canon_sha256":"78a52deb86b6356ff8cbbedf5ebbba8d171f9b415d6baa9e9493ee5b1a46296b"},"schema_version":"1.0"},"canonical_sha256":"19f299c8c7bfae10b1e9319da786b4ebc2b5c33f321b014aca83daf56db830f2","source":{"kind":"arxiv","id":"1311.0512","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.0512","created_at":"2026-05-18T01:32:11Z"},{"alias_kind":"arxiv_version","alias_value":"1311.0512v2","created_at":"2026-05-18T01:32:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.0512","created_at":"2026-05-18T01:32:11Z"},{"alias_kind":"pith_short_12","alias_value":"DHZJTSGHX6XB","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"DHZJTSGHX6XBBMPJ","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"DHZJTSGH","created_at":"2026-05-18T12:27:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:DHZJTSGHX6XBBMPJGGO2PBVU5P","target":"record","payload":{"canonical_record":{"source":{"id":"1311.0512","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-11-03T19:28:27Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"599d24c940532a8acdaba17b7462dd0ea2d3e4b85c5f1dbf90e74a24cd229db3","abstract_canon_sha256":"78a52deb86b6356ff8cbbedf5ebbba8d171f9b415d6baa9e9493ee5b1a46296b"},"schema_version":"1.0"},"canonical_sha256":"19f299c8c7bfae10b1e9319da786b4ebc2b5c33f321b014aca83daf56db830f2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:32:11.006650Z","signature_b64":"BiIGPpGl6VkreXkEwQNQktahEurBz5VW87MIZBXsbLdzexclDkMjoPR+wg/QQ3Fs9tnLlEWGJC33Bvy6WWytBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"19f299c8c7bfae10b1e9319da786b4ebc2b5c33f321b014aca83daf56db830f2","last_reissued_at":"2026-05-18T01:32:11.005922Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:32:11.005922Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1311.0512","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-18T01:32:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"txxMKq6Ud4oW2kzq20Zj+mbWYEKUPtCWsKPnzN+lziFgAMlf4oBgrAfRw5evcJUSN43CXorHmaN6V/fJjA3vDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T08:58:40.466540Z"},"content_sha256":"09711fe2937d10366448280d473e81b81821857e690a13c360bb61c5d9d7e981","schema_version":"1.0","event_id":"sha256:09711fe2937d10366448280d473e81b81821857e690a13c360bb61c5d9d7e981"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:DHZJTSGHX6XBBMPJGGO2PBVU5P","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Avoiding 5-circuits in a 2-factor of cubic graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Barbora Candr\\'akov\\'a, Robert Luko\\v{t}ka","submitted_at":"2013-11-03T19:28:27Z","abstract_excerpt":"We show that every bridgeless cubic graph $G$ on $n$ vertices other than the Petersen graph has a 2-factor with at most $2(n-2)/15$ circuits of length $5$. An infinite family of graphs attains this bound. We also show that $G$ has a 2-factor with at most $n/5.8\\overline{3}$ odd circuits. This improves the previously known bound of $n/5.41$ [Luko\\v{t}ka, M\\'a\\v{c}ajov\\'a, Maz\\'ak, \\v{S}koviera: Small snarks with large oddness, arXiv:1212.3641 [cs.DM] ]."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.0512","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-18T01:32:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o4ZQ8CKK8JmwWPnuSPpJant+NLSYXzsNXHZDAma2eOWiO1M1UU3SNWlGjDnNRUQd4w64Bo4qdBmt0H4hl1r6Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T08:58:40.467072Z"},"content_sha256":"759c1342008ed40fc030e8e5a98e198f56e4133dbf398940738556cd0fab1455","schema_version":"1.0","event_id":"sha256:759c1342008ed40fc030e8e5a98e198f56e4133dbf398940738556cd0fab1455"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DHZJTSGHX6XBBMPJGGO2PBVU5P/bundle.json","state_url":"https://pith.science/pith/DHZJTSGHX6XBBMPJGGO2PBVU5P/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DHZJTSGHX6XBBMPJGGO2PBVU5P/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-07T08:58:40Z","links":{"resolver":"https://pith.science/pith/DHZJTSGHX6XBBMPJGGO2PBVU5P","bundle":"https://pith.science/pith/DHZJTSGHX6XBBMPJGGO2PBVU5P/bundle.json","state":"https://pith.science/pith/DHZJTSGHX6XBBMPJGGO2PBVU5P/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DHZJTSGHX6XBBMPJGGO2PBVU5P/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:DHZJTSGHX6XBBMPJGGO2PBVU5P","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":"78a52deb86b6356ff8cbbedf5ebbba8d171f9b415d6baa9e9493ee5b1a46296b","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-11-03T19:28:27Z","title_canon_sha256":"599d24c940532a8acdaba17b7462dd0ea2d3e4b85c5f1dbf90e74a24cd229db3"},"schema_version":"1.0","source":{"id":"1311.0512","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.0512","created_at":"2026-05-18T01:32:11Z"},{"alias_kind":"arxiv_version","alias_value":"1311.0512v2","created_at":"2026-05-18T01:32:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.0512","created_at":"2026-05-18T01:32:11Z"},{"alias_kind":"pith_short_12","alias_value":"DHZJTSGHX6XB","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"DHZJTSGHX6XBBMPJ","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"DHZJTSGH","created_at":"2026-05-18T12:27:43Z"}],"graph_snapshots":[{"event_id":"sha256:759c1342008ed40fc030e8e5a98e198f56e4133dbf398940738556cd0fab1455","target":"graph","created_at":"2026-05-18T01:32:11Z","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":"We show that every bridgeless cubic graph $G$ on $n$ vertices other than the Petersen graph has a 2-factor with at most $2(n-2)/15$ circuits of length $5$. An infinite family of graphs attains this bound. We also show that $G$ has a 2-factor with at most $n/5.8\\overline{3}$ odd circuits. This improves the previously known bound of $n/5.41$ [Luko\\v{t}ka, M\\'a\\v{c}ajov\\'a, Maz\\'ak, \\v{S}koviera: Small snarks with large oddness, arXiv:1212.3641 [cs.DM] ].","authors_text":"Barbora Candr\\'akov\\'a, Robert Luko\\v{t}ka","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-11-03T19:28:27Z","title":"Avoiding 5-circuits in a 2-factor of cubic graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.0512","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:09711fe2937d10366448280d473e81b81821857e690a13c360bb61c5d9d7e981","target":"record","created_at":"2026-05-18T01:32:11Z","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":"78a52deb86b6356ff8cbbedf5ebbba8d171f9b415d6baa9e9493ee5b1a46296b","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-11-03T19:28:27Z","title_canon_sha256":"599d24c940532a8acdaba17b7462dd0ea2d3e4b85c5f1dbf90e74a24cd229db3"},"schema_version":"1.0","source":{"id":"1311.0512","kind":"arxiv","version":2}},"canonical_sha256":"19f299c8c7bfae10b1e9319da786b4ebc2b5c33f321b014aca83daf56db830f2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"19f299c8c7bfae10b1e9319da786b4ebc2b5c33f321b014aca83daf56db830f2","first_computed_at":"2026-05-18T01:32:11.005922Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:32:11.005922Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BiIGPpGl6VkreXkEwQNQktahEurBz5VW87MIZBXsbLdzexclDkMjoPR+wg/QQ3Fs9tnLlEWGJC33Bvy6WWytBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:32:11.006650Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.0512","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:09711fe2937d10366448280d473e81b81821857e690a13c360bb61c5d9d7e981","sha256:759c1342008ed40fc030e8e5a98e198f56e4133dbf398940738556cd0fab1455"],"state_sha256":"4872ca0af8bc8caa4b6cf1e9b745d3cfcb11a1f26806d6cbeb858009a9d8b395"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uj8MoX/YxBd5RWYPNk6tVjegoLCNTKt5mgZ4jjgjKEN+A/GmVsSyQfY9kCrXw+zdUdyQVGYIfU6xQ+4mXuLeBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T08:58:40.469781Z","bundle_sha256":"64c1ee58620f4e97bff1d476111a66c4040c56a2c1761a3faa8cbf80c9ccc35a"}}