{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:BKEIDSWVFW2SYHND2VOI62TPBG","short_pith_number":"pith:BKEIDSWV","canonical_record":{"source":{"id":"1706.05595","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-06-18T00:10:44Z","cross_cats_sorted":[],"title_canon_sha256":"86b1c7feaaadd78afcd6f370852806e09597df0098afa0594911b1f1987e217a","abstract_canon_sha256":"f41fe22dec009b24a9c9d070508676cf0707c05b93a6cb056709e5ba3cd2bc0b"},"schema_version":"1.0"},"canonical_sha256":"0a8881cad52db52c1da3d55c8f6a6f0980cff0e50a5e1c4c418e83e618f7ca58","source":{"kind":"arxiv","id":"1706.05595","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.05595","created_at":"2026-05-18T00:03:56Z"},{"alias_kind":"arxiv_version","alias_value":"1706.05595v2","created_at":"2026-05-18T00:03:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.05595","created_at":"2026-05-18T00:03:56Z"},{"alias_kind":"pith_short_12","alias_value":"BKEIDSWVFW2S","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BKEIDSWVFW2SYHND","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BKEIDSWV","created_at":"2026-05-18T12:31:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:BKEIDSWVFW2SYHND2VOI62TPBG","target":"record","payload":{"canonical_record":{"source":{"id":"1706.05595","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-06-18T00:10:44Z","cross_cats_sorted":[],"title_canon_sha256":"86b1c7feaaadd78afcd6f370852806e09597df0098afa0594911b1f1987e217a","abstract_canon_sha256":"f41fe22dec009b24a9c9d070508676cf0707c05b93a6cb056709e5ba3cd2bc0b"},"schema_version":"1.0"},"canonical_sha256":"0a8881cad52db52c1da3d55c8f6a6f0980cff0e50a5e1c4c418e83e618f7ca58","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:56.988048Z","signature_b64":"uKpObGsxTtB9+rV/n0EWGRAjNzpcxlof/OyJKbUje1EFgV0Ygu8WES6U1INnfPz4x2MVdDGKNBjVBQHy/gRYCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0a8881cad52db52c1da3d55c8f6a6f0980cff0e50a5e1c4c418e83e618f7ca58","last_reissued_at":"2026-05-18T00:03:56.987507Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:56.987507Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.05595","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-18T00:03:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xh2PgWc+dxEgr2ZOlEmxNNa6fBkRMt0pbIpOS7uPwNBRT99YQB8x5V/S/aa3WUasW7VMIkp+USNYcEGql6RDBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T17:42:06.948675Z"},"content_sha256":"55958c515fb3c2c8f83a61583bc579430ff21c3c4e511718530a5da0453bce57","schema_version":"1.0","event_id":"sha256:55958c515fb3c2c8f83a61583bc579430ff21c3c4e511718530a5da0453bce57"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:BKEIDSWVFW2SYHND2VOI62TPBG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Snarks with special spanning trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Arthur Hoffmann-Ostenhof, Thomas Jatschka","submitted_at":"2017-06-18T00:10:44Z","abstract_excerpt":"Let $G$ be a cubic graph which has a decomposition into a spanning tree $T$ and a $2$-regular subgraph $C$, i.e. $E(T) \\cup E(C) = E(G)$ and $E(T) \\cap E(C) = \\emptyset$. We provide an answer to the following question: which lengths can the cycles of $C$ have if $G$ is a snark? Note that $T$ is a hist (i.e. a spanning tree without a vertex of degree two) and that every cubic graph with a hist has the above decomposition."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.05595","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-18T00:03:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CoF8CAt65OcNV0q/cAnC4UvAjaoHOlkE6uZuNr94EzBuVRdeS4wL+gW69WDps46bw4HBU0TT5x+rctoAHePcCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T17:42:06.949389Z"},"content_sha256":"5c98be2533a8cc15c53d14ee6d43058caf42a845605d90b9fa1d4ee5b793790d","schema_version":"1.0","event_id":"sha256:5c98be2533a8cc15c53d14ee6d43058caf42a845605d90b9fa1d4ee5b793790d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BKEIDSWVFW2SYHND2VOI62TPBG/bundle.json","state_url":"https://pith.science/pith/BKEIDSWVFW2SYHND2VOI62TPBG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BKEIDSWVFW2SYHND2VOI62TPBG/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-08T17:42:06Z","links":{"resolver":"https://pith.science/pith/BKEIDSWVFW2SYHND2VOI62TPBG","bundle":"https://pith.science/pith/BKEIDSWVFW2SYHND2VOI62TPBG/bundle.json","state":"https://pith.science/pith/BKEIDSWVFW2SYHND2VOI62TPBG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BKEIDSWVFW2SYHND2VOI62TPBG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:BKEIDSWVFW2SYHND2VOI62TPBG","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":"f41fe22dec009b24a9c9d070508676cf0707c05b93a6cb056709e5ba3cd2bc0b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-06-18T00:10:44Z","title_canon_sha256":"86b1c7feaaadd78afcd6f370852806e09597df0098afa0594911b1f1987e217a"},"schema_version":"1.0","source":{"id":"1706.05595","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.05595","created_at":"2026-05-18T00:03:56Z"},{"alias_kind":"arxiv_version","alias_value":"1706.05595v2","created_at":"2026-05-18T00:03:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.05595","created_at":"2026-05-18T00:03:56Z"},{"alias_kind":"pith_short_12","alias_value":"BKEIDSWVFW2S","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BKEIDSWVFW2SYHND","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BKEIDSWV","created_at":"2026-05-18T12:31:08Z"}],"graph_snapshots":[{"event_id":"sha256:5c98be2533a8cc15c53d14ee6d43058caf42a845605d90b9fa1d4ee5b793790d","target":"graph","created_at":"2026-05-18T00:03:56Z","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":"Let $G$ be a cubic graph which has a decomposition into a spanning tree $T$ and a $2$-regular subgraph $C$, i.e. $E(T) \\cup E(C) = E(G)$ and $E(T) \\cap E(C) = \\emptyset$. We provide an answer to the following question: which lengths can the cycles of $C$ have if $G$ is a snark? Note that $T$ is a hist (i.e. a spanning tree without a vertex of degree two) and that every cubic graph with a hist has the above decomposition.","authors_text":"Arthur Hoffmann-Ostenhof, Thomas Jatschka","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-06-18T00:10:44Z","title":"Snarks with special spanning trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.05595","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:55958c515fb3c2c8f83a61583bc579430ff21c3c4e511718530a5da0453bce57","target":"record","created_at":"2026-05-18T00:03:56Z","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":"f41fe22dec009b24a9c9d070508676cf0707c05b93a6cb056709e5ba3cd2bc0b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-06-18T00:10:44Z","title_canon_sha256":"86b1c7feaaadd78afcd6f370852806e09597df0098afa0594911b1f1987e217a"},"schema_version":"1.0","source":{"id":"1706.05595","kind":"arxiv","version":2}},"canonical_sha256":"0a8881cad52db52c1da3d55c8f6a6f0980cff0e50a5e1c4c418e83e618f7ca58","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0a8881cad52db52c1da3d55c8f6a6f0980cff0e50a5e1c4c418e83e618f7ca58","first_computed_at":"2026-05-18T00:03:56.987507Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:03:56.987507Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uKpObGsxTtB9+rV/n0EWGRAjNzpcxlof/OyJKbUje1EFgV0Ygu8WES6U1INnfPz4x2MVdDGKNBjVBQHy/gRYCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:03:56.988048Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.05595","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:55958c515fb3c2c8f83a61583bc579430ff21c3c4e511718530a5da0453bce57","sha256:5c98be2533a8cc15c53d14ee6d43058caf42a845605d90b9fa1d4ee5b793790d"],"state_sha256":"e42baf7a7215d04467581de1cee754c483d7ee4397e4dcc09fa07e3c11e78aa2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2sTEaPB0f2HZOETTyO3umITrvVeQlCWDc8wIMadlFETC0kFyZ5V6I7gmdvFmM0gtFtaL6XtD0q0SqkR1s5yjAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T17:42:06.953262Z","bundle_sha256":"94b360dd7f092164497dc738c313c3eb984c5bef71b171ddeac71d8d63e61da6"}}