{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:6A4U5I5DK4BDXGFNWNKJNU64SU","short_pith_number":"pith:6A4U5I5D","schema_version":"1.0","canonical_sha256":"f0394ea3a357023b98adb35496d3dc9529ff9f654986cc112f5020be9cabf839","source":{"kind":"arxiv","id":"1607.05112","version":1},"attestation_state":"computed","paper":{"title":"Minimum cycle and homology bases of surface embedded graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DS","authors_text":"Amir Nayyeri, Erin Wolf Chambers, Glencora Borradaile, Kyle Fox","submitted_at":"2016-07-18T14:58:06Z","abstract_excerpt":"We study the problems of finding a minimum cycle basis (a minimum weight set of cycles that form a basis for the cycle space) and a minimum homology basis (a minimum weight set of cycles that generates the $1$-dimensional ($\\mathbb{Z}_2$)-homology classes) of an undirected graph embedded on a surface. The problems are closely related, because the minimum cycle basis of a graph contains its minimum homology basis, and the minimum homology basis of the $1$-skeleton of any graph is exactly its minimum cycle basis.\n  For the minimum cycle basis problem, we give a deterministic $O(n^\\omega+2^{2g}n^"},"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":"1607.05112","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-18T14:58:06Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"a0e10f9955260909461aa5e2b9ba13746de129db005af517cd87f7223a253043","abstract_canon_sha256":"7e7336d48d6bdde247b7c9bfb60cb2db5c3e3e96b9d3692c7b854fbfb8e91537"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:55.887607Z","signature_b64":"HppXE2yzZQ7gZg+SrGhSXuNWJBlvZ4iVpFQb8kndWqjOVT4aQ0IHygD5NzuXRvMfX0J2t2cjQCTAKiWLFpCMBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f0394ea3a357023b98adb35496d3dc9529ff9f654986cc112f5020be9cabf839","last_reissued_at":"2026-05-18T01:10:55.887044Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:55.887044Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimum cycle and homology bases of surface embedded graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DS","authors_text":"Amir Nayyeri, Erin Wolf Chambers, Glencora Borradaile, Kyle Fox","submitted_at":"2016-07-18T14:58:06Z","abstract_excerpt":"We study the problems of finding a minimum cycle basis (a minimum weight set of cycles that form a basis for the cycle space) and a minimum homology basis (a minimum weight set of cycles that generates the $1$-dimensional ($\\mathbb{Z}_2$)-homology classes) of an undirected graph embedded on a surface. The problems are closely related, because the minimum cycle basis of a graph contains its minimum homology basis, and the minimum homology basis of the $1$-skeleton of any graph is exactly its minimum cycle basis.\n  For the minimum cycle basis problem, we give a deterministic $O(n^\\omega+2^{2g}n^"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.05112","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":"1607.05112","created_at":"2026-05-18T01:10:55.887138+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.05112v1","created_at":"2026-05-18T01:10:55.887138+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.05112","created_at":"2026-05-18T01:10:55.887138+00:00"},{"alias_kind":"pith_short_12","alias_value":"6A4U5I5DK4BD","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_16","alias_value":"6A4U5I5DK4BDXGFN","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_8","alias_value":"6A4U5I5D","created_at":"2026-05-18T12:30:01.593930+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/6A4U5I5DK4BDXGFNWNKJNU64SU","json":"https://pith.science/pith/6A4U5I5DK4BDXGFNWNKJNU64SU.json","graph_json":"https://pith.science/api/pith-number/6A4U5I5DK4BDXGFNWNKJNU64SU/graph.json","events_json":"https://pith.science/api/pith-number/6A4U5I5DK4BDXGFNWNKJNU64SU/events.json","paper":"https://pith.science/paper/6A4U5I5D"},"agent_actions":{"view_html":"https://pith.science/pith/6A4U5I5DK4BDXGFNWNKJNU64SU","download_json":"https://pith.science/pith/6A4U5I5DK4BDXGFNWNKJNU64SU.json","view_paper":"https://pith.science/paper/6A4U5I5D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.05112&json=true","fetch_graph":"https://pith.science/api/pith-number/6A4U5I5DK4BDXGFNWNKJNU64SU/graph.json","fetch_events":"https://pith.science/api/pith-number/6A4U5I5DK4BDXGFNWNKJNU64SU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6A4U5I5DK4BDXGFNWNKJNU64SU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6A4U5I5DK4BDXGFNWNKJNU64SU/action/storage_attestation","attest_author":"https://pith.science/pith/6A4U5I5DK4BDXGFNWNKJNU64SU/action/author_attestation","sign_citation":"https://pith.science/pith/6A4U5I5DK4BDXGFNWNKJNU64SU/action/citation_signature","submit_replication":"https://pith.science/pith/6A4U5I5DK4BDXGFNWNKJNU64SU/action/replication_record"}},"created_at":"2026-05-18T01:10:55.887138+00:00","updated_at":"2026-05-18T01:10:55.887138+00:00"}