{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:NTLFL5SMNUG5XA5HF2VPC7PIJQ","short_pith_number":"pith:NTLFL5SM","schema_version":"1.0","canonical_sha256":"6cd655f64c6d0ddb83a72eaaf17de84c347fc773aa22eefdbc15c3d14a3ddd0f","source":{"kind":"arxiv","id":"1706.03808","version":1},"attestation_state":"computed","paper":{"title":"Shorter signed circuit covers of 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, Edita Rollov\\'a, Robert Lukot'ka, Tom\\'a\\v{s} Kaiser","submitted_at":"2017-06-12T18:50:33Z","abstract_excerpt":"A signed circuit is a minimal signed graph (with respect to inclusion) that admits a nowhere-zero flow. We show that each flow-admissible signed graph on $m$ edges can be covered by signed circuits of total length at most $(3+2/3)\\cdot m$, improving a recent result of Cheng et al. [manuscript, 2015]. To obtain this improvement we prove several results on signed circuit covers of trees of Eulerian graphs, which are connected signed graphs such that removing all bridges results in a collection of Eulerian graphs."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1706.03808","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-06-12T18:50:33Z","cross_cats_sorted":[],"title_canon_sha256":"9f2816ccdf6eb2a0a1060e834f78f456431e3d0ba0cb9471e13f46e68b5f8cca","abstract_canon_sha256":"69199b7606936690ba4ec8807301410e2e4df97992e348d6d58e5b47413aed20"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:28.321199Z","signature_b64":"Jbc3tEBpjlblKKHvAlzX/q0KNDNR0/9QdngEM41N40/6nq33C9r+PUG3/Womv27V5/SwxLwoq41xJmfIjwTDAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6cd655f64c6d0ddb83a72eaaf17de84c347fc773aa22eefdbc15c3d14a3ddd0f","last_reissued_at":"2026-05-18T00:42:28.320636Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:28.320636Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Shorter signed circuit covers of 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, Edita Rollov\\'a, Robert Lukot'ka, Tom\\'a\\v{s} Kaiser","submitted_at":"2017-06-12T18:50:33Z","abstract_excerpt":"A signed circuit is a minimal signed graph (with respect to inclusion) that admits a nowhere-zero flow. We show that each flow-admissible signed graph on $m$ edges can be covered by signed circuits of total length at most $(3+2/3)\\cdot m$, improving a recent result of Cheng et al. [manuscript, 2015]. To obtain this improvement we prove several results on signed circuit covers of trees of Eulerian graphs, which are connected signed graphs such that removing all bridges results in a collection of Eulerian graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.03808","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1706.03808","created_at":"2026-05-18T00:42:28.320742+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.03808v1","created_at":"2026-05-18T00:42:28.320742+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.03808","created_at":"2026-05-18T00:42:28.320742+00:00"},{"alias_kind":"pith_short_12","alias_value":"NTLFL5SMNUG5","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_16","alias_value":"NTLFL5SMNUG5XA5H","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_8","alias_value":"NTLFL5SM","created_at":"2026-05-18T12:31:34.259226+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NTLFL5SMNUG5XA5HF2VPC7PIJQ","json":"https://pith.science/pith/NTLFL5SMNUG5XA5HF2VPC7PIJQ.json","graph_json":"https://pith.science/api/pith-number/NTLFL5SMNUG5XA5HF2VPC7PIJQ/graph.json","events_json":"https://pith.science/api/pith-number/NTLFL5SMNUG5XA5HF2VPC7PIJQ/events.json","paper":"https://pith.science/paper/NTLFL5SM"},"agent_actions":{"view_html":"https://pith.science/pith/NTLFL5SMNUG5XA5HF2VPC7PIJQ","download_json":"https://pith.science/pith/NTLFL5SMNUG5XA5HF2VPC7PIJQ.json","view_paper":"https://pith.science/paper/NTLFL5SM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.03808&json=true","fetch_graph":"https://pith.science/api/pith-number/NTLFL5SMNUG5XA5HF2VPC7PIJQ/graph.json","fetch_events":"https://pith.science/api/pith-number/NTLFL5SMNUG5XA5HF2VPC7PIJQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NTLFL5SMNUG5XA5HF2VPC7PIJQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NTLFL5SMNUG5XA5HF2VPC7PIJQ/action/storage_attestation","attest_author":"https://pith.science/pith/NTLFL5SMNUG5XA5HF2VPC7PIJQ/action/author_attestation","sign_citation":"https://pith.science/pith/NTLFL5SMNUG5XA5HF2VPC7PIJQ/action/citation_signature","submit_replication":"https://pith.science/pith/NTLFL5SMNUG5XA5HF2VPC7PIJQ/action/replication_record"}},"created_at":"2026-05-18T00:42:28.320742+00:00","updated_at":"2026-05-18T00:42:28.320742+00:00"}