{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:VIGQA2CK7UREGKFONEDRHCDF5L","short_pith_number":"pith:VIGQA2CK","schema_version":"1.0","canonical_sha256":"aa0d00684afd224328ae6907138865eade31f345829ebe5924d83742000c8608","source":{"kind":"arxiv","id":"1306.1158","version":1},"attestation_state":"computed","paper":{"title":"Distributed computation of homology using harmonics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"math.AT","authors_text":"Hamid Krim, Harish Chintakunta","submitted_at":"2013-06-05T15:54:19Z","abstract_excerpt":"We present a distributed algorithm to compute the first homology of a simplicial complex. Such algorithms are very useful in topological analysis of sensor networks, such as its coverage properties. We employ spanning trees to compute a basis for algebraic 1-cycles, and then use harmonics to efficiently identify the contractible and homologous cycles. The computational complexity of the algorithm is $O(|P|^\\omega)$, where $|P|$ is much smaller than the number of edges, and $\\omega$ is the complexity order of matrix multiplication. For geometric graphs, we show using simulations that $|P|$ is v"},"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":"1306.1158","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AT","submitted_at":"2013-06-05T15:54:19Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"a9507eaa887c3f9797e91e7b2ff63d440066cfd350ea931321b9b4320c153733","abstract_canon_sha256":"c23bd61b16bf4e4a0fd1e501dba38ae2aa488d6326ba79a3b7fc5f898879c5d6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:21:44.124236Z","signature_b64":"RwP/Tzbi3naA5+iyGW0ZjUysNEIa9S78cRSJDI5upciZqLydNWutTzbuIHlL1W0fYNxaSsAdcmt27akTnjJSCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aa0d00684afd224328ae6907138865eade31f345829ebe5924d83742000c8608","last_reissued_at":"2026-05-18T03:21:44.123448Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:21:44.123448Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed computation of homology using harmonics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"math.AT","authors_text":"Hamid Krim, Harish Chintakunta","submitted_at":"2013-06-05T15:54:19Z","abstract_excerpt":"We present a distributed algorithm to compute the first homology of a simplicial complex. Such algorithms are very useful in topological analysis of sensor networks, such as its coverage properties. We employ spanning trees to compute a basis for algebraic 1-cycles, and then use harmonics to efficiently identify the contractible and homologous cycles. The computational complexity of the algorithm is $O(|P|^\\omega)$, where $|P|$ is much smaller than the number of edges, and $\\omega$ is the complexity order of matrix multiplication. For geometric graphs, we show using simulations that $|P|$ is v"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.1158","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":"1306.1158","created_at":"2026-05-18T03:21:44.123581+00:00"},{"alias_kind":"arxiv_version","alias_value":"1306.1158v1","created_at":"2026-05-18T03:21:44.123581+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.1158","created_at":"2026-05-18T03:21:44.123581+00:00"},{"alias_kind":"pith_short_12","alias_value":"VIGQA2CK7URE","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_16","alias_value":"VIGQA2CK7UREGKFO","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_8","alias_value":"VIGQA2CK","created_at":"2026-05-18T12:28:04.890932+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/VIGQA2CK7UREGKFONEDRHCDF5L","json":"https://pith.science/pith/VIGQA2CK7UREGKFONEDRHCDF5L.json","graph_json":"https://pith.science/api/pith-number/VIGQA2CK7UREGKFONEDRHCDF5L/graph.json","events_json":"https://pith.science/api/pith-number/VIGQA2CK7UREGKFONEDRHCDF5L/events.json","paper":"https://pith.science/paper/VIGQA2CK"},"agent_actions":{"view_html":"https://pith.science/pith/VIGQA2CK7UREGKFONEDRHCDF5L","download_json":"https://pith.science/pith/VIGQA2CK7UREGKFONEDRHCDF5L.json","view_paper":"https://pith.science/paper/VIGQA2CK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1306.1158&json=true","fetch_graph":"https://pith.science/api/pith-number/VIGQA2CK7UREGKFONEDRHCDF5L/graph.json","fetch_events":"https://pith.science/api/pith-number/VIGQA2CK7UREGKFONEDRHCDF5L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VIGQA2CK7UREGKFONEDRHCDF5L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VIGQA2CK7UREGKFONEDRHCDF5L/action/storage_attestation","attest_author":"https://pith.science/pith/VIGQA2CK7UREGKFONEDRHCDF5L/action/author_attestation","sign_citation":"https://pith.science/pith/VIGQA2CK7UREGKFONEDRHCDF5L/action/citation_signature","submit_replication":"https://pith.science/pith/VIGQA2CK7UREGKFONEDRHCDF5L/action/replication_record"}},"created_at":"2026-05-18T03:21:44.123581+00:00","updated_at":"2026-05-18T03:21:44.123581+00:00"}