{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:3VQZS3WVMIMUUKZTZP25YBRLPM","short_pith_number":"pith:3VQZS3WV","schema_version":"1.0","canonical_sha256":"dd61996ed562194a2b33cbf5dc062b7b380e11dd6820342e8b4cc089b3010029","source":{"kind":"arxiv","id":"1506.04785","version":1},"attestation_state":"computed","paper":{"title":"Heegaard Floer homology of spatial graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GT","authors_text":"Danielle O'Donnol, Shelly Harvey","submitted_at":"2015-06-15T22:00:31Z","abstract_excerpt":"We extend the theory of combinatorial link Floer homology to a class of oriented spatial graphs called transverse spatial graphs. To do this, we define the notion of a grid diagram representing a transverse spatial graph, which we call a graph grid diagram. We prove that two graph grid diagrams representing the same transverse spatial graph are related by a sequence of graph grid moves, generalizing the work of Cromwell for links. For a graph grid diagram representing a transverse spatial graph $f:G \\rightarrow S^3$, we define a relatively bigraded chain complex (which is a module over a multi"},"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":"1506.04785","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2015-06-15T22:00:31Z","cross_cats_sorted":[],"title_canon_sha256":"da92ae2a6aa7f3de0be88ac3f8cf6394ee5637cbf6d1579e506a6ac8c96ee4ed","abstract_canon_sha256":"4dfd8c03691fda648b299b174fbdddbc88f185cdd3245d291c7c665fd4c13478"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:21:00.412426Z","signature_b64":"AQwXxdzdiwBXVX+Y1c4s359tLqP9nPGShpCAnTsVOeDzPF4S7vIm+uBcSE9sDksfY60Qx+heojk+em0aNATBBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dd61996ed562194a2b33cbf5dc062b7b380e11dd6820342e8b4cc089b3010029","last_reissued_at":"2026-05-18T00:21:00.411959Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:21:00.411959Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Heegaard Floer homology of spatial graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GT","authors_text":"Danielle O'Donnol, Shelly Harvey","submitted_at":"2015-06-15T22:00:31Z","abstract_excerpt":"We extend the theory of combinatorial link Floer homology to a class of oriented spatial graphs called transverse spatial graphs. To do this, we define the notion of a grid diagram representing a transverse spatial graph, which we call a graph grid diagram. We prove that two graph grid diagrams representing the same transverse spatial graph are related by a sequence of graph grid moves, generalizing the work of Cromwell for links. For a graph grid diagram representing a transverse spatial graph $f:G \\rightarrow S^3$, we define a relatively bigraded chain complex (which is a module over a multi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.04785","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":"1506.04785","created_at":"2026-05-18T00:21:00.412031+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.04785v1","created_at":"2026-05-18T00:21:00.412031+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.04785","created_at":"2026-05-18T00:21:00.412031+00:00"},{"alias_kind":"pith_short_12","alias_value":"3VQZS3WVMIMU","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_16","alias_value":"3VQZS3WVMIMUUKZT","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_8","alias_value":"3VQZS3WV","created_at":"2026-05-18T12:29:02.477457+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/3VQZS3WVMIMUUKZTZP25YBRLPM","json":"https://pith.science/pith/3VQZS3WVMIMUUKZTZP25YBRLPM.json","graph_json":"https://pith.science/api/pith-number/3VQZS3WVMIMUUKZTZP25YBRLPM/graph.json","events_json":"https://pith.science/api/pith-number/3VQZS3WVMIMUUKZTZP25YBRLPM/events.json","paper":"https://pith.science/paper/3VQZS3WV"},"agent_actions":{"view_html":"https://pith.science/pith/3VQZS3WVMIMUUKZTZP25YBRLPM","download_json":"https://pith.science/pith/3VQZS3WVMIMUUKZTZP25YBRLPM.json","view_paper":"https://pith.science/paper/3VQZS3WV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.04785&json=true","fetch_graph":"https://pith.science/api/pith-number/3VQZS3WVMIMUUKZTZP25YBRLPM/graph.json","fetch_events":"https://pith.science/api/pith-number/3VQZS3WVMIMUUKZTZP25YBRLPM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3VQZS3WVMIMUUKZTZP25YBRLPM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3VQZS3WVMIMUUKZTZP25YBRLPM/action/storage_attestation","attest_author":"https://pith.science/pith/3VQZS3WVMIMUUKZTZP25YBRLPM/action/author_attestation","sign_citation":"https://pith.science/pith/3VQZS3WVMIMUUKZTZP25YBRLPM/action/citation_signature","submit_replication":"https://pith.science/pith/3VQZS3WVMIMUUKZTZP25YBRLPM/action/replication_record"}},"created_at":"2026-05-18T00:21:00.412031+00:00","updated_at":"2026-05-18T00:21:00.412031+00:00"}