{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:6IS2FOHNVOUFB3VXYRCYIGY6WS","short_pith_number":"pith:6IS2FOHN","canonical_record":{"source":{"id":"1510.05717","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-10-19T23:22:39Z","cross_cats_sorted":[],"title_canon_sha256":"7f96043d83c0f31d56678881323b5c1d0a27a686554118e02cdd1566deedb435","abstract_canon_sha256":"65e92c7188ad596aaece7f68665f732f6d5b2f5eae36fe598510d478f866be2d"},"schema_version":"1.0"},"canonical_sha256":"f225a2b8edaba850eeb7c445841b1eb4bb3ee1c65765ff0c30c1c29af6110253","source":{"kind":"arxiv","id":"1510.05717","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.05717","created_at":"2026-05-18T01:29:39Z"},{"alias_kind":"arxiv_version","alias_value":"1510.05717v1","created_at":"2026-05-18T01:29:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.05717","created_at":"2026-05-18T01:29:39Z"},{"alias_kind":"pith_short_12","alias_value":"6IS2FOHNVOUF","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"6IS2FOHNVOUFB3VX","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"6IS2FOHN","created_at":"2026-05-18T12:29:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:6IS2FOHNVOUFB3VXYRCYIGY6WS","target":"record","payload":{"canonical_record":{"source":{"id":"1510.05717","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-10-19T23:22:39Z","cross_cats_sorted":[],"title_canon_sha256":"7f96043d83c0f31d56678881323b5c1d0a27a686554118e02cdd1566deedb435","abstract_canon_sha256":"65e92c7188ad596aaece7f68665f732f6d5b2f5eae36fe598510d478f866be2d"},"schema_version":"1.0"},"canonical_sha256":"f225a2b8edaba850eeb7c445841b1eb4bb3ee1c65765ff0c30c1c29af6110253","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:29:39.904648Z","signature_b64":"jVEiptrcTYpPOJQRmCvifP1i+Y6yX5z6VbB+Ce8rE3JHMWQ5vBeWKKgyd6lMkasehqTv/p102USGiWI+MTSXCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f225a2b8edaba850eeb7c445841b1eb4bb3ee1c65765ff0c30c1c29af6110253","last_reissued_at":"2026-05-18T01:29:39.904075Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:29:39.904075Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1510.05717","source_version":1,"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:29:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/XXRhCnhJmVAcv734FwybhxIXN6a1pcPesl4gW14lUjWLj9XyMxv1nN3SbGSiSDJj/BWcytvQ6V6IklnU8VRAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T03:20:25.049524Z"},"content_sha256":"6fa38936bddb68e6fb22857ccfa9103b38c549f5948f8d47023a2e3812a5ca4f","schema_version":"1.0","event_id":"sha256:6fa38936bddb68e6fb22857ccfa9103b38c549f5948f8d47023a2e3812a5ca4f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:6IS2FOHNVOUFB3VXYRCYIGY6WS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Shortest circuit covers of signed graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Cun-Quan Zhang, Jian Cheng, Rong Luo, You Lu","submitted_at":"2015-10-19T23:22:39Z","abstract_excerpt":"A shortest circuit cover ${\\cal F}$ of a bridgeless graph $G$ is a family of circuits that covers every edge of $G$ and is of minimum total length. The total length of a shortest circuit cover ${\\cal F}$ of $G$ is denoted by $SCC(G)$. For ordinary graphs (graphs without sign), the subject of shortest circuit cover is closely related to some mainstream areas, such as, Tutte's integer flow theory, circuit double cover conjecture, Fulkerson conjecture, and others. For signed graphs $G$, it is proved recently by\n  M\\'a\\v{c}ajov\\'a, Raspaud, Rollov\\'a and \\v{S}koviera that $SCC(G) \\leq 11|E|$ if $G"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.05717","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"},"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:29:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G9Ep64q6HaGlPkXM2tQibtGf5dslRPZRI/6IXj9/UQ6oKTA545iWkBk3blP9qUCUraeRkLnp2qiW/MD8X6/JDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T03:20:25.049993Z"},"content_sha256":"b72dda31bdd5b4d80ac64c6ca46be74117e902045e4415dc2cf41803e55d7bf9","schema_version":"1.0","event_id":"sha256:b72dda31bdd5b4d80ac64c6ca46be74117e902045e4415dc2cf41803e55d7bf9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6IS2FOHNVOUFB3VXYRCYIGY6WS/bundle.json","state_url":"https://pith.science/pith/6IS2FOHNVOUFB3VXYRCYIGY6WS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6IS2FOHNVOUFB3VXYRCYIGY6WS/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-26T03:20:25Z","links":{"resolver":"https://pith.science/pith/6IS2FOHNVOUFB3VXYRCYIGY6WS","bundle":"https://pith.science/pith/6IS2FOHNVOUFB3VXYRCYIGY6WS/bundle.json","state":"https://pith.science/pith/6IS2FOHNVOUFB3VXYRCYIGY6WS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6IS2FOHNVOUFB3VXYRCYIGY6WS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:6IS2FOHNVOUFB3VXYRCYIGY6WS","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":"65e92c7188ad596aaece7f68665f732f6d5b2f5eae36fe598510d478f866be2d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-10-19T23:22:39Z","title_canon_sha256":"7f96043d83c0f31d56678881323b5c1d0a27a686554118e02cdd1566deedb435"},"schema_version":"1.0","source":{"id":"1510.05717","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.05717","created_at":"2026-05-18T01:29:39Z"},{"alias_kind":"arxiv_version","alias_value":"1510.05717v1","created_at":"2026-05-18T01:29:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.05717","created_at":"2026-05-18T01:29:39Z"},{"alias_kind":"pith_short_12","alias_value":"6IS2FOHNVOUF","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"6IS2FOHNVOUFB3VX","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"6IS2FOHN","created_at":"2026-05-18T12:29:07Z"}],"graph_snapshots":[{"event_id":"sha256:b72dda31bdd5b4d80ac64c6ca46be74117e902045e4415dc2cf41803e55d7bf9","target":"graph","created_at":"2026-05-18T01:29:39Z","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":"A shortest circuit cover ${\\cal F}$ of a bridgeless graph $G$ is a family of circuits that covers every edge of $G$ and is of minimum total length. The total length of a shortest circuit cover ${\\cal F}$ of $G$ is denoted by $SCC(G)$. For ordinary graphs (graphs without sign), the subject of shortest circuit cover is closely related to some mainstream areas, such as, Tutte's integer flow theory, circuit double cover conjecture, Fulkerson conjecture, and others. For signed graphs $G$, it is proved recently by\n  M\\'a\\v{c}ajov\\'a, Raspaud, Rollov\\'a and \\v{S}koviera that $SCC(G) \\leq 11|E|$ if $G","authors_text":"Cun-Quan Zhang, Jian Cheng, Rong Luo, You Lu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-10-19T23:22:39Z","title":"Shortest circuit covers of signed graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.05717","kind":"arxiv","version":1},"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:6fa38936bddb68e6fb22857ccfa9103b38c549f5948f8d47023a2e3812a5ca4f","target":"record","created_at":"2026-05-18T01:29:39Z","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":"65e92c7188ad596aaece7f68665f732f6d5b2f5eae36fe598510d478f866be2d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-10-19T23:22:39Z","title_canon_sha256":"7f96043d83c0f31d56678881323b5c1d0a27a686554118e02cdd1566deedb435"},"schema_version":"1.0","source":{"id":"1510.05717","kind":"arxiv","version":1}},"canonical_sha256":"f225a2b8edaba850eeb7c445841b1eb4bb3ee1c65765ff0c30c1c29af6110253","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f225a2b8edaba850eeb7c445841b1eb4bb3ee1c65765ff0c30c1c29af6110253","first_computed_at":"2026-05-18T01:29:39.904075Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:29:39.904075Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jVEiptrcTYpPOJQRmCvifP1i+Y6yX5z6VbB+Ce8rE3JHMWQ5vBeWKKgyd6lMkasehqTv/p102USGiWI+MTSXCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:29:39.904648Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.05717","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6fa38936bddb68e6fb22857ccfa9103b38c549f5948f8d47023a2e3812a5ca4f","sha256:b72dda31bdd5b4d80ac64c6ca46be74117e902045e4415dc2cf41803e55d7bf9"],"state_sha256":"714bf0bf62f505a3a1a4455b7aacac81c39cd974a9eb2afb01ff42bcde0e1c88"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rhXPZiXun/GwaqeF9gJQqvDVf2SLo0kjWGceKOyC3fdPprqRT06jJEPVm/wmT/E6gr3P4FmvxvLlPI5TPoc2Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T03:20:25.052457Z","bundle_sha256":"e65d3d50586f0b14978e57c2065ad2b57ca9dc29e011414289365bd3353a3a4b"}}