{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:VFOBHOOVKYKQTPEDOLI5PS76Y3","short_pith_number":"pith:VFOBHOOV","canonical_record":{"source":{"id":"1403.7667","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-03-29T20:30:18Z","cross_cats_sorted":[],"title_canon_sha256":"349c139c45acfb636fde0b5b70709d19944cf15367976955d04f08bc8e3840f9","abstract_canon_sha256":"5a49a6f86699ef3b6d1ee2025745e13dbe538774cc14ccc8db2021d34a7f2a63"},"schema_version":"1.0"},"canonical_sha256":"a95c13b9d5561509bc8372d1d7cbfec6d36082919d42b470e91c752030242fa9","source":{"kind":"arxiv","id":"1403.7667","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.7667","created_at":"2026-05-18T02:46:32Z"},{"alias_kind":"arxiv_version","alias_value":"1403.7667v2","created_at":"2026-05-18T02:46:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.7667","created_at":"2026-05-18T02:46:32Z"},{"alias_kind":"pith_short_12","alias_value":"VFOBHOOVKYKQ","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"VFOBHOOVKYKQTPED","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"VFOBHOOV","created_at":"2026-05-18T12:28:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:VFOBHOOVKYKQTPEDOLI5PS76Y3","target":"record","payload":{"canonical_record":{"source":{"id":"1403.7667","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-03-29T20:30:18Z","cross_cats_sorted":[],"title_canon_sha256":"349c139c45acfb636fde0b5b70709d19944cf15367976955d04f08bc8e3840f9","abstract_canon_sha256":"5a49a6f86699ef3b6d1ee2025745e13dbe538774cc14ccc8db2021d34a7f2a63"},"schema_version":"1.0"},"canonical_sha256":"a95c13b9d5561509bc8372d1d7cbfec6d36082919d42b470e91c752030242fa9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:46:32.615019Z","signature_b64":"eTYOoMe7tIs1WZyht8lUMAXq+RPTt0TM1V34XptPbXUwZoIzs0FmjJoWRGF52CyvI0y380o/oEB9iOgfikeqCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a95c13b9d5561509bc8372d1d7cbfec6d36082919d42b470e91c752030242fa9","last_reissued_at":"2026-05-18T02:46:32.614559Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:46:32.614559Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1403.7667","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-18T02:46:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pVCXOJsRvezuPDTLbM9ic5UYCSnycPLcHXiqFrseYJgaeRtQYXYCemQBdQJ1jnoZm7zxpXMTvQv+dDnsiMNHBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T23:35:33.350834Z"},"content_sha256":"55bce65c70b0ce74329204aef9b2ce53b0ead1faa1c1ac1ac0410eb42e5f9f07","schema_version":"1.0","event_id":"sha256:55bce65c70b0ce74329204aef9b2ce53b0ead1faa1c1ac1ac0410eb42e5f9f07"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:VFOBHOOVKYKQTPEDOLI5PS76Y3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"When does a biased graph come from a group labelling?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Daryl Funk, Irene Pivotto, Matt DeVos","submitted_at":"2014-03-29T20:30:18Z","abstract_excerpt":"A biased graph consists of a graph $G$ together with a collection of distinguished cycles of $G$, called balanced cycles, with the property that no theta subgraph contains exactly two balanced cycles. Perhaps the most natural biased graphs on $G$ arise from orienting $G$ and then labelling the edges of $G$ with elements of a group $\\Gamma$. In this case, we may define a biased graph by declaring a cycle to be balanced if the product of the labels on its edges is the identity, with the convention that we take the inverse value for an edge traversed backwards. Our first result gives a natural to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.7667","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-18T02:46:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fGtaFlnjlhiH/SzLdykTfNJgOE0jd49AEDM99331aqk0XOkZlgXaAuUhmnCW9mELT2xxISEunrVyaN67hG/XCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T23:35:33.351182Z"},"content_sha256":"a8d62b6dcc35bbad620539bf8de451053af89139db577846a730697059e217a9","schema_version":"1.0","event_id":"sha256:a8d62b6dcc35bbad620539bf8de451053af89139db577846a730697059e217a9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VFOBHOOVKYKQTPEDOLI5PS76Y3/bundle.json","state_url":"https://pith.science/pith/VFOBHOOVKYKQTPEDOLI5PS76Y3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VFOBHOOVKYKQTPEDOLI5PS76Y3/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-20T23:35:33Z","links":{"resolver":"https://pith.science/pith/VFOBHOOVKYKQTPEDOLI5PS76Y3","bundle":"https://pith.science/pith/VFOBHOOVKYKQTPEDOLI5PS76Y3/bundle.json","state":"https://pith.science/pith/VFOBHOOVKYKQTPEDOLI5PS76Y3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VFOBHOOVKYKQTPEDOLI5PS76Y3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:VFOBHOOVKYKQTPEDOLI5PS76Y3","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":"5a49a6f86699ef3b6d1ee2025745e13dbe538774cc14ccc8db2021d34a7f2a63","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-03-29T20:30:18Z","title_canon_sha256":"349c139c45acfb636fde0b5b70709d19944cf15367976955d04f08bc8e3840f9"},"schema_version":"1.0","source":{"id":"1403.7667","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.7667","created_at":"2026-05-18T02:46:32Z"},{"alias_kind":"arxiv_version","alias_value":"1403.7667v2","created_at":"2026-05-18T02:46:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.7667","created_at":"2026-05-18T02:46:32Z"},{"alias_kind":"pith_short_12","alias_value":"VFOBHOOVKYKQ","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"VFOBHOOVKYKQTPED","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"VFOBHOOV","created_at":"2026-05-18T12:28:52Z"}],"graph_snapshots":[{"event_id":"sha256:a8d62b6dcc35bbad620539bf8de451053af89139db577846a730697059e217a9","target":"graph","created_at":"2026-05-18T02:46:32Z","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 biased graph consists of a graph $G$ together with a collection of distinguished cycles of $G$, called balanced cycles, with the property that no theta subgraph contains exactly two balanced cycles. Perhaps the most natural biased graphs on $G$ arise from orienting $G$ and then labelling the edges of $G$ with elements of a group $\\Gamma$. In this case, we may define a biased graph by declaring a cycle to be balanced if the product of the labels on its edges is the identity, with the convention that we take the inverse value for an edge traversed backwards. Our first result gives a natural to","authors_text":"Daryl Funk, Irene Pivotto, Matt DeVos","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-03-29T20:30:18Z","title":"When does a biased graph come from a group labelling?"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.7667","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:55bce65c70b0ce74329204aef9b2ce53b0ead1faa1c1ac1ac0410eb42e5f9f07","target":"record","created_at":"2026-05-18T02:46:32Z","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":"5a49a6f86699ef3b6d1ee2025745e13dbe538774cc14ccc8db2021d34a7f2a63","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-03-29T20:30:18Z","title_canon_sha256":"349c139c45acfb636fde0b5b70709d19944cf15367976955d04f08bc8e3840f9"},"schema_version":"1.0","source":{"id":"1403.7667","kind":"arxiv","version":2}},"canonical_sha256":"a95c13b9d5561509bc8372d1d7cbfec6d36082919d42b470e91c752030242fa9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a95c13b9d5561509bc8372d1d7cbfec6d36082919d42b470e91c752030242fa9","first_computed_at":"2026-05-18T02:46:32.614559Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:46:32.614559Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eTYOoMe7tIs1WZyht8lUMAXq+RPTt0TM1V34XptPbXUwZoIzs0FmjJoWRGF52CyvI0y380o/oEB9iOgfikeqCA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:46:32.615019Z","signed_message":"canonical_sha256_bytes"},"source_id":"1403.7667","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:55bce65c70b0ce74329204aef9b2ce53b0ead1faa1c1ac1ac0410eb42e5f9f07","sha256:a8d62b6dcc35bbad620539bf8de451053af89139db577846a730697059e217a9"],"state_sha256":"26294c686b9d05e5d4df9d72e4d267ff916d4e5a29071c86b2de93b870c132ae"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sJ/3oCzC6RbkF3p71DK++dAUy/sGBLAdK2HDOmEL7qAMT0md7B1PB+l0Qc8z0hp+gkY0OdpX+nuqrrVyFsQWCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T23:35:33.353118Z","bundle_sha256":"6de827cb76c9c1aac29afe82ce9c3e1a18ae763af4a0dc0da903fae6e4e74709"}}