{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:LKSTGQ7JJLNZY2GJD2Z5UNHODQ","short_pith_number":"pith:LKSTGQ7J","schema_version":"1.0","canonical_sha256":"5aa53343e94adb9c68c91eb3da34ee1c25ea430c2736d360ad3fc21f416544c1","source":{"kind":"arxiv","id":"1003.5115","version":4},"attestation_state":"computed","paper":{"title":"Cycle decompositions: from graphs to continua","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AT","math.CO"],"primary_cat":"math.GN","authors_text":"Agelos Georgakopoulos","submitted_at":"2010-03-26T11:15:11Z","abstract_excerpt":"We generalise a fundamental graph-theoretical fact, stating that every element of the cycle space of a graph is a sum of edge-disjoint cycles, to arbitrary continua. To achieve this we replace graph cycles by topological circles, and replace the cycle space of a graph by a new homology group for continua which is a quotient of the first singular homology group $H_1$. This homology seems to be particularly apt for studying spaces with infinitely generated $H_1$, e.g. infinite graphs or fractals."},"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":"1003.5115","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GN","submitted_at":"2010-03-26T11:15:11Z","cross_cats_sorted":["math.AT","math.CO"],"title_canon_sha256":"dd8a45e4d3e7a3c8e5a51962bc2cd410a55668a3632d8cc5253841640c800ebe","abstract_canon_sha256":"581b3ea2fc201120d1db896754616dde2d19b1fa653475f3f5d6cf928631da50"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:10:10.667853Z","signature_b64":"PVtsNaobe/YKYSR3QhsLTLKlUWPIL0dez8UMuEITYGFd1o9lOaDBM4NEpawGffbzn1wWNwaN5b6JZ8m+BkLCAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5aa53343e94adb9c68c91eb3da34ee1c25ea430c2736d360ad3fc21f416544c1","last_reissued_at":"2026-05-18T04:10:10.666905Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:10:10.666905Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cycle decompositions: from graphs to continua","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AT","math.CO"],"primary_cat":"math.GN","authors_text":"Agelos Georgakopoulos","submitted_at":"2010-03-26T11:15:11Z","abstract_excerpt":"We generalise a fundamental graph-theoretical fact, stating that every element of the cycle space of a graph is a sum of edge-disjoint cycles, to arbitrary continua. To achieve this we replace graph cycles by topological circles, and replace the cycle space of a graph by a new homology group for continua which is a quotient of the first singular homology group $H_1$. This homology seems to be particularly apt for studying spaces with infinitely generated $H_1$, e.g. infinite graphs or fractals."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1003.5115","kind":"arxiv","version":4},"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":"1003.5115","created_at":"2026-05-18T04:10:10.667056+00:00"},{"alias_kind":"arxiv_version","alias_value":"1003.5115v4","created_at":"2026-05-18T04:10:10.667056+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1003.5115","created_at":"2026-05-18T04:10:10.667056+00:00"},{"alias_kind":"pith_short_12","alias_value":"LKSTGQ7JJLNZ","created_at":"2026-05-18T12:26:10.704358+00:00"},{"alias_kind":"pith_short_16","alias_value":"LKSTGQ7JJLNZY2GJ","created_at":"2026-05-18T12:26:10.704358+00:00"},{"alias_kind":"pith_short_8","alias_value":"LKSTGQ7J","created_at":"2026-05-18T12:26:10.704358+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/LKSTGQ7JJLNZY2GJD2Z5UNHODQ","json":"https://pith.science/pith/LKSTGQ7JJLNZY2GJD2Z5UNHODQ.json","graph_json":"https://pith.science/api/pith-number/LKSTGQ7JJLNZY2GJD2Z5UNHODQ/graph.json","events_json":"https://pith.science/api/pith-number/LKSTGQ7JJLNZY2GJD2Z5UNHODQ/events.json","paper":"https://pith.science/paper/LKSTGQ7J"},"agent_actions":{"view_html":"https://pith.science/pith/LKSTGQ7JJLNZY2GJD2Z5UNHODQ","download_json":"https://pith.science/pith/LKSTGQ7JJLNZY2GJD2Z5UNHODQ.json","view_paper":"https://pith.science/paper/LKSTGQ7J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1003.5115&json=true","fetch_graph":"https://pith.science/api/pith-number/LKSTGQ7JJLNZY2GJD2Z5UNHODQ/graph.json","fetch_events":"https://pith.science/api/pith-number/LKSTGQ7JJLNZY2GJD2Z5UNHODQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LKSTGQ7JJLNZY2GJD2Z5UNHODQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LKSTGQ7JJLNZY2GJD2Z5UNHODQ/action/storage_attestation","attest_author":"https://pith.science/pith/LKSTGQ7JJLNZY2GJD2Z5UNHODQ/action/author_attestation","sign_citation":"https://pith.science/pith/LKSTGQ7JJLNZY2GJD2Z5UNHODQ/action/citation_signature","submit_replication":"https://pith.science/pith/LKSTGQ7JJLNZY2GJD2Z5UNHODQ/action/replication_record"}},"created_at":"2026-05-18T04:10:10.667056+00:00","updated_at":"2026-05-18T04:10:10.667056+00:00"}