{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:YPSGJOUKESAT5J3OCSUZV6FCZ4","short_pith_number":"pith:YPSGJOUK","schema_version":"1.0","canonical_sha256":"c3e464ba8a24813ea76e14a99af8a2cf2d9bd945b34edc973abe09bcd261b78d","source":{"kind":"arxiv","id":"2006.05333","version":1},"attestation_state":"computed","paper":{"title":"Computing Homotopy Types of Directed Flag Complexes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.AT","authors_text":"Dejan Govc","submitted_at":"2020-06-09T15:15:47Z","abstract_excerpt":"Combinatorially and stochastically defined simplicial complexes often have the homotopy type of a wedge of spheres. A prominent conjecture of Kahle quantifies this precisely for the case of random flag complexes. We explore whether such properties might extend to graphs arising from nature. We consider the brain network (as reconstructed by Varshney & al.) of the Caenorhabditis elegans nematode, an important model organism in biology. Using an iterative computational procedure based on elementary methods of algebraic topology, namely homology, simplicial collapses and coning operations, we sho"},"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":"2006.05333","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AT","submitted_at":"2020-06-09T15:15:47Z","cross_cats_sorted":[],"title_canon_sha256":"3a6c85c794265310ec306995e65213c6fe150b4b32844906e6ca8fdcccdf857b","abstract_canon_sha256":"8d440419c7b8f011059390070ffe55a9c8916db20847e560c3b9c13cb1256e85"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:09:12.785128Z","signature_b64":"OnYztZT3aR1Z59lSYK+/Ie5nWyLklRovfyMWKZUmq121/k8xBd0MaASUxLTeXsQxBVTkiLWHrmPiDmZiylJVAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c3e464ba8a24813ea76e14a99af8a2cf2d9bd945b34edc973abe09bcd261b78d","last_reissued_at":"2026-07-05T01:09:12.784728Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:09:12.784728Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computing Homotopy Types of Directed Flag Complexes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.AT","authors_text":"Dejan Govc","submitted_at":"2020-06-09T15:15:47Z","abstract_excerpt":"Combinatorially and stochastically defined simplicial complexes often have the homotopy type of a wedge of spheres. A prominent conjecture of Kahle quantifies this precisely for the case of random flag complexes. We explore whether such properties might extend to graphs arising from nature. We consider the brain network (as reconstructed by Varshney & al.) of the Caenorhabditis elegans nematode, an important model organism in biology. Using an iterative computational procedure based on elementary methods of algebraic topology, namely homology, simplicial collapses and coning operations, we sho"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.05333","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2006.05333/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2006.05333","created_at":"2026-07-05T01:09:12.784786+00:00"},{"alias_kind":"arxiv_version","alias_value":"2006.05333v1","created_at":"2026-07-05T01:09:12.784786+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.05333","created_at":"2026-07-05T01:09:12.784786+00:00"},{"alias_kind":"pith_short_12","alias_value":"YPSGJOUKESAT","created_at":"2026-07-05T01:09:12.784786+00:00"},{"alias_kind":"pith_short_16","alias_value":"YPSGJOUKESAT5J3O","created_at":"2026-07-05T01:09:12.784786+00:00"},{"alias_kind":"pith_short_8","alias_value":"YPSGJOUK","created_at":"2026-07-05T01:09:12.784786+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.26786","citing_title":"Avalanche homology of digraphs via sandpile dynamics","ref_index":46,"is_internal_anchor":false},{"citing_arxiv_id":"2605.12509","citing_title":"Representing Higher-Order Networks: A Survey of Graph-Based Frameworks","ref_index":292,"is_internal_anchor":false},{"citing_arxiv_id":"2605.12509","citing_title":"Representing Higher-Order Networks: A Survey of Graph-Based Frameworks","ref_index":191,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YPSGJOUKESAT5J3OCSUZV6FCZ4","json":"https://pith.science/pith/YPSGJOUKESAT5J3OCSUZV6FCZ4.json","graph_json":"https://pith.science/api/pith-number/YPSGJOUKESAT5J3OCSUZV6FCZ4/graph.json","events_json":"https://pith.science/api/pith-number/YPSGJOUKESAT5J3OCSUZV6FCZ4/events.json","paper":"https://pith.science/paper/YPSGJOUK"},"agent_actions":{"view_html":"https://pith.science/pith/YPSGJOUKESAT5J3OCSUZV6FCZ4","download_json":"https://pith.science/pith/YPSGJOUKESAT5J3OCSUZV6FCZ4.json","view_paper":"https://pith.science/paper/YPSGJOUK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2006.05333&json=true","fetch_graph":"https://pith.science/api/pith-number/YPSGJOUKESAT5J3OCSUZV6FCZ4/graph.json","fetch_events":"https://pith.science/api/pith-number/YPSGJOUKESAT5J3OCSUZV6FCZ4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YPSGJOUKESAT5J3OCSUZV6FCZ4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YPSGJOUKESAT5J3OCSUZV6FCZ4/action/storage_attestation","attest_author":"https://pith.science/pith/YPSGJOUKESAT5J3OCSUZV6FCZ4/action/author_attestation","sign_citation":"https://pith.science/pith/YPSGJOUKESAT5J3OCSUZV6FCZ4/action/citation_signature","submit_replication":"https://pith.science/pith/YPSGJOUKESAT5J3OCSUZV6FCZ4/action/replication_record"}},"created_at":"2026-07-05T01:09:12.784786+00:00","updated_at":"2026-07-05T01:09:12.784786+00:00"}