{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:BFVTTWHXH2K2VTUETBRZNWMUTK","short_pith_number":"pith:BFVTTWHX","schema_version":"1.0","canonical_sha256":"096b39d8f73e95aace84986396d9949aa337bd4b7d8ec925191bc76f378d9491","source":{"kind":"arxiv","id":"1403.5799","version":2},"attestation_state":"computed","paper":{"title":"Crossed simplicial groups and structured surfaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.AT","authors_text":"Mikhail Kapranov, Tobias Dyckerhoff","submitted_at":"2014-03-23T20:47:56Z","abstract_excerpt":"We propose a generalization of the concept of a Ribbon graph suitable to provide combinatorial models for marked surfaces equipped with a G-structure. Our main insight is that the necessary combinatorics is neatly captured in the concept of a crossed simplicial group as introduced, independently, by Krasauskas and Fiedorowicz-Loday. In this context, Connes' cyclic category leads to Ribbon graphs while other crossed simplicial groups naturally yield different notions of structured graphs which model unoriented, N-spin, framed, etc, surfaces. Our main result is that structured graphs provide orb"},"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":"1403.5799","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AT","submitted_at":"2014-03-23T20:47:56Z","cross_cats_sorted":[],"title_canon_sha256":"14fcfdd89853d4a09668d9f09434306405e056dbeb7087b8900d2323e74d9a7c","abstract_canon_sha256":"fe32e8774c247821eaad669aa181df60eb4c13f42ffc7faedffa7d3efc79b4e7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:44:13.826079Z","signature_b64":"/GKQ16ohrS4b5Dg3LPY/yOKUQTJEyxgIjlkDIQRM0cPLt2DWAXHD1gANSLG6Ssip7+KdEnG8wr8HmoQ3G1ZaCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"096b39d8f73e95aace84986396d9949aa337bd4b7d8ec925191bc76f378d9491","last_reissued_at":"2026-07-05T02:44:13.825672Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:44:13.825672Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Crossed simplicial groups and structured surfaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.AT","authors_text":"Mikhail Kapranov, Tobias Dyckerhoff","submitted_at":"2014-03-23T20:47:56Z","abstract_excerpt":"We propose a generalization of the concept of a Ribbon graph suitable to provide combinatorial models for marked surfaces equipped with a G-structure. Our main insight is that the necessary combinatorics is neatly captured in the concept of a crossed simplicial group as introduced, independently, by Krasauskas and Fiedorowicz-Loday. In this context, Connes' cyclic category leads to Ribbon graphs while other crossed simplicial groups naturally yield different notions of structured graphs which model unoriented, N-spin, framed, etc, surfaces. Our main result is that structured graphs provide orb"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.5799","kind":"arxiv","version":2},"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/1403.5799/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":"1403.5799","created_at":"2026-07-05T02:44:13.825727+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.5799v2","created_at":"2026-07-05T02:44:13.825727+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.5799","created_at":"2026-07-05T02:44:13.825727+00:00"},{"alias_kind":"pith_short_12","alias_value":"BFVTTWHXH2K2","created_at":"2026-07-05T02:44:13.825727+00:00"},{"alias_kind":"pith_short_16","alias_value":"BFVTTWHXH2K2VTUE","created_at":"2026-07-05T02:44:13.825727+00:00"},{"alias_kind":"pith_short_8","alias_value":"BFVTTWHX","created_at":"2026-07-05T02:44:13.825727+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.04029","citing_title":"Minimal triangulations of circle bundles, circular permutations and binary Chern cocycle","ref_index":4,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BFVTTWHXH2K2VTUETBRZNWMUTK","json":"https://pith.science/pith/BFVTTWHXH2K2VTUETBRZNWMUTK.json","graph_json":"https://pith.science/api/pith-number/BFVTTWHXH2K2VTUETBRZNWMUTK/graph.json","events_json":"https://pith.science/api/pith-number/BFVTTWHXH2K2VTUETBRZNWMUTK/events.json","paper":"https://pith.science/paper/BFVTTWHX"},"agent_actions":{"view_html":"https://pith.science/pith/BFVTTWHXH2K2VTUETBRZNWMUTK","download_json":"https://pith.science/pith/BFVTTWHXH2K2VTUETBRZNWMUTK.json","view_paper":"https://pith.science/paper/BFVTTWHX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.5799&json=true","fetch_graph":"https://pith.science/api/pith-number/BFVTTWHXH2K2VTUETBRZNWMUTK/graph.json","fetch_events":"https://pith.science/api/pith-number/BFVTTWHXH2K2VTUETBRZNWMUTK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BFVTTWHXH2K2VTUETBRZNWMUTK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BFVTTWHXH2K2VTUETBRZNWMUTK/action/storage_attestation","attest_author":"https://pith.science/pith/BFVTTWHXH2K2VTUETBRZNWMUTK/action/author_attestation","sign_citation":"https://pith.science/pith/BFVTTWHXH2K2VTUETBRZNWMUTK/action/citation_signature","submit_replication":"https://pith.science/pith/BFVTTWHXH2K2VTUETBRZNWMUTK/action/replication_record"}},"created_at":"2026-07-05T02:44:13.825727+00:00","updated_at":"2026-07-05T02:44:13.825727+00:00"}