{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:CNJVLOANDF35ORWB2H2PKG733F","short_pith_number":"pith:CNJVLOAN","canonical_record":{"source":{"id":"1607.00053","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-30T21:30:50Z","cross_cats_sorted":[],"title_canon_sha256":"85c56c7711f3a0dcdce584188761ce520efb1dfc0344b3cc548c4d79123060fa","abstract_canon_sha256":"e0812c9bbafdf6e8128513f8e840a25f2541bd439afc00efdbd06d58b9c9a968"},"schema_version":"1.0"},"canonical_sha256":"135355b80d1977d746c1d1f4f51bfbd97646072bf1e7451ad6fccb35ec7f266a","source":{"kind":"arxiv","id":"1607.00053","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.00053","created_at":"2026-05-18T01:11:38Z"},{"alias_kind":"arxiv_version","alias_value":"1607.00053v1","created_at":"2026-05-18T01:11:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.00053","created_at":"2026-05-18T01:11:38Z"},{"alias_kind":"pith_short_12","alias_value":"CNJVLOANDF35","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"CNJVLOANDF35ORWB","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"CNJVLOAN","created_at":"2026-05-18T12:30:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:CNJVLOANDF35ORWB2H2PKG733F","target":"record","payload":{"canonical_record":{"source":{"id":"1607.00053","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-30T21:30:50Z","cross_cats_sorted":[],"title_canon_sha256":"85c56c7711f3a0dcdce584188761ce520efb1dfc0344b3cc548c4d79123060fa","abstract_canon_sha256":"e0812c9bbafdf6e8128513f8e840a25f2541bd439afc00efdbd06d58b9c9a968"},"schema_version":"1.0"},"canonical_sha256":"135355b80d1977d746c1d1f4f51bfbd97646072bf1e7451ad6fccb35ec7f266a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:38.122297Z","signature_b64":"ea+B5NRE3jVHuSiQU58QSEl/jRTLcto4AQZH6aobQH064jxuUI93pfBNACx3lIEEtsbzSlt53YsGmIinc3IPAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"135355b80d1977d746c1d1f4f51bfbd97646072bf1e7451ad6fccb35ec7f266a","last_reissued_at":"2026-05-18T01:11:38.121942Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:38.121942Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.00053","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:11:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AufQnawg+637o6TgqXeyH3iYvawMSMhNP7rzTzc9akQF+YtRX7KqNMatfYNmpdeJihlvgOIagX9midHBKn9/Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T02:33:20.997681Z"},"content_sha256":"170e516e743066ef5acd5a4b97c119ccbd8ba4badb03aa92b227e1d7857bd69a","schema_version":"1.0","event_id":"sha256:170e516e743066ef5acd5a4b97c119ccbd8ba4badb03aa92b227e1d7857bd69a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:CNJVLOANDF35ORWB2H2PKG733F","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Odd decompositions of eulerian graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Edita M\\'a\\v{c}ajov\\'a, Martin \\v{S}koviera","submitted_at":"2016-06-30T21:30:50Z","abstract_excerpt":"We prove that an eulerian graph $G$ admits a decomposition into $k$ closed trails of odd length if and only if and it contains at least $k$ pairwise edge-disjoint odd circuits and $k\\equiv |E(G)|\\pmod{2}$. We conjecture that a connected $2d$-regular graph of odd order with $d\\ge 1$ admits a decomposition into $d$ odd closed trails sharing a common vertex and verify the conjecture for $d\\le 3$. The case $d=3$ is crucial for determining the flow number of a signed eulerian graph which is treated in a separate paper (arXiv:1408.1703v2). The proof of our conjecture for $d=3$ is surprisingly diffic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.00053","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:11:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0zXBUKv0hZ0Bzl7S4+ZkAF/XciZ0Tm0KB88oQWZbGimrFnHGorZST3+Qvy2youFKPhWajM40q9qIkW1cpQIjAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T02:33:20.998360Z"},"content_sha256":"7feb833b0ac5942e4a90c96b1547e9250b86f329d43822617055ee47a6d482b3","schema_version":"1.0","event_id":"sha256:7feb833b0ac5942e4a90c96b1547e9250b86f329d43822617055ee47a6d482b3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CNJVLOANDF35ORWB2H2PKG733F/bundle.json","state_url":"https://pith.science/pith/CNJVLOANDF35ORWB2H2PKG733F/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CNJVLOANDF35ORWB2H2PKG733F/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-05-26T02:33:21Z","links":{"resolver":"https://pith.science/pith/CNJVLOANDF35ORWB2H2PKG733F","bundle":"https://pith.science/pith/CNJVLOANDF35ORWB2H2PKG733F/bundle.json","state":"https://pith.science/pith/CNJVLOANDF35ORWB2H2PKG733F/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CNJVLOANDF35ORWB2H2PKG733F/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:CNJVLOANDF35ORWB2H2PKG733F","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":"e0812c9bbafdf6e8128513f8e840a25f2541bd439afc00efdbd06d58b9c9a968","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-30T21:30:50Z","title_canon_sha256":"85c56c7711f3a0dcdce584188761ce520efb1dfc0344b3cc548c4d79123060fa"},"schema_version":"1.0","source":{"id":"1607.00053","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.00053","created_at":"2026-05-18T01:11:38Z"},{"alias_kind":"arxiv_version","alias_value":"1607.00053v1","created_at":"2026-05-18T01:11:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.00053","created_at":"2026-05-18T01:11:38Z"},{"alias_kind":"pith_short_12","alias_value":"CNJVLOANDF35","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"CNJVLOANDF35ORWB","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"CNJVLOAN","created_at":"2026-05-18T12:30:09Z"}],"graph_snapshots":[{"event_id":"sha256:7feb833b0ac5942e4a90c96b1547e9250b86f329d43822617055ee47a6d482b3","target":"graph","created_at":"2026-05-18T01:11:38Z","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 prove that an eulerian graph $G$ admits a decomposition into $k$ closed trails of odd length if and only if and it contains at least $k$ pairwise edge-disjoint odd circuits and $k\\equiv |E(G)|\\pmod{2}$. We conjecture that a connected $2d$-regular graph of odd order with $d\\ge 1$ admits a decomposition into $d$ odd closed trails sharing a common vertex and verify the conjecture for $d\\le 3$. The case $d=3$ is crucial for determining the flow number of a signed eulerian graph which is treated in a separate paper (arXiv:1408.1703v2). The proof of our conjecture for $d=3$ is surprisingly diffic","authors_text":"Edita M\\'a\\v{c}ajov\\'a, Martin \\v{S}koviera","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-30T21:30:50Z","title":"Odd decompositions of eulerian graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.00053","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:170e516e743066ef5acd5a4b97c119ccbd8ba4badb03aa92b227e1d7857bd69a","target":"record","created_at":"2026-05-18T01:11:38Z","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":"e0812c9bbafdf6e8128513f8e840a25f2541bd439afc00efdbd06d58b9c9a968","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-30T21:30:50Z","title_canon_sha256":"85c56c7711f3a0dcdce584188761ce520efb1dfc0344b3cc548c4d79123060fa"},"schema_version":"1.0","source":{"id":"1607.00053","kind":"arxiv","version":1}},"canonical_sha256":"135355b80d1977d746c1d1f4f51bfbd97646072bf1e7451ad6fccb35ec7f266a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"135355b80d1977d746c1d1f4f51bfbd97646072bf1e7451ad6fccb35ec7f266a","first_computed_at":"2026-05-18T01:11:38.121942Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:11:38.121942Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ea+B5NRE3jVHuSiQU58QSEl/jRTLcto4AQZH6aobQH064jxuUI93pfBNACx3lIEEtsbzSlt53YsGmIinc3IPAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:11:38.122297Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.00053","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:170e516e743066ef5acd5a4b97c119ccbd8ba4badb03aa92b227e1d7857bd69a","sha256:7feb833b0ac5942e4a90c96b1547e9250b86f329d43822617055ee47a6d482b3"],"state_sha256":"46c5b07ca325721b745d09e14dbbfef588ed036c8bf982f82aa80f856e642a0e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"45cLIc4Ixu1O2GpRxZ6FTtf4OJH2XFCJVKuapUCRkSlhV1yPO4cNTWDL7Jkog+mK3QlpKfqR11Vcg3Z2E/fbCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T02:33:21.002008Z","bundle_sha256":"4405985ad58769333e394561852571ded8b544b63ea63b6086f52f6a6aff4361"}}