{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:2JU7SAGSVACLG4L6E54FINJYP3","short_pith_number":"pith:2JU7SAGS","schema_version":"1.0","canonical_sha256":"d269f900d2a804b3717e27785435387eefa6382a50dabdbdcbcee422da5ad5b8","source":{"kind":"arxiv","id":"1408.1011","version":3},"attestation_state":"computed","paper":{"title":"Non-hierarchical Structures: How to Model and Index Overlaps?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.IR"],"primary_cat":"cs.DB","authors_text":"Faegheh Hasibi, Svein Erik Bratsberg","submitted_at":"2014-08-05T16:07:11Z","abstract_excerpt":"Overlap is a common phenomenon seen when structural components of a digital object are neither disjoint nor nested inside each other. Overlapping components resist reduction to a structural hierarchy, and tree-based indexing and query processing techniques cannot be used for them. Our solution to this data modeling problem is TGSA (Tree-like Graph for Structural Annotations), a novel extension of the XML data model for non-hierarchical structures. We introduce an algorithm for constructing TGSA from annotated documents; the algorithm can efficiently process non-hierarchical structures and is a"},"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":"1408.1011","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2014-08-05T16:07:11Z","cross_cats_sorted":["cs.DS","cs.IR"],"title_canon_sha256":"f48581a60357b07c7f1b43ac71e480b724f2e3bdb9ef8df3f377203136470696","abstract_canon_sha256":"496109d3c8a1944fea9c3410b6703c1966cd1ab5d82ab35378841cf580512871"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:02:57.182584Z","signature_b64":"7hHwTVaPEyRFimaxk67mMHeOAFPQO/SNsCq7EYctkkhNXP/fiSMF6+iP+RRH6FzcB//F2mzBbkBL24DbqPc5BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d269f900d2a804b3717e27785435387eefa6382a50dabdbdcbcee422da5ad5b8","last_reissued_at":"2026-05-18T01:02:57.182146Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:02:57.182146Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Non-hierarchical Structures: How to Model and Index Overlaps?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.IR"],"primary_cat":"cs.DB","authors_text":"Faegheh Hasibi, Svein Erik Bratsberg","submitted_at":"2014-08-05T16:07:11Z","abstract_excerpt":"Overlap is a common phenomenon seen when structural components of a digital object are neither disjoint nor nested inside each other. Overlapping components resist reduction to a structural hierarchy, and tree-based indexing and query processing techniques cannot be used for them. Our solution to this data modeling problem is TGSA (Tree-like Graph for Structural Annotations), a novel extension of the XML data model for non-hierarchical structures. We introduce an algorithm for constructing TGSA from annotated documents; the algorithm can efficiently process non-hierarchical structures and is a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.1011","kind":"arxiv","version":3},"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":"1408.1011","created_at":"2026-05-18T01:02:57.182213+00:00"},{"alias_kind":"arxiv_version","alias_value":"1408.1011v3","created_at":"2026-05-18T01:02:57.182213+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.1011","created_at":"2026-05-18T01:02:57.182213+00:00"},{"alias_kind":"pith_short_12","alias_value":"2JU7SAGSVACL","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_16","alias_value":"2JU7SAGSVACLG4L6","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_8","alias_value":"2JU7SAGS","created_at":"2026-05-18T12:28:11.866339+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/2JU7SAGSVACLG4L6E54FINJYP3","json":"https://pith.science/pith/2JU7SAGSVACLG4L6E54FINJYP3.json","graph_json":"https://pith.science/api/pith-number/2JU7SAGSVACLG4L6E54FINJYP3/graph.json","events_json":"https://pith.science/api/pith-number/2JU7SAGSVACLG4L6E54FINJYP3/events.json","paper":"https://pith.science/paper/2JU7SAGS"},"agent_actions":{"view_html":"https://pith.science/pith/2JU7SAGSVACLG4L6E54FINJYP3","download_json":"https://pith.science/pith/2JU7SAGSVACLG4L6E54FINJYP3.json","view_paper":"https://pith.science/paper/2JU7SAGS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1408.1011&json=true","fetch_graph":"https://pith.science/api/pith-number/2JU7SAGSVACLG4L6E54FINJYP3/graph.json","fetch_events":"https://pith.science/api/pith-number/2JU7SAGSVACLG4L6E54FINJYP3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2JU7SAGSVACLG4L6E54FINJYP3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2JU7SAGSVACLG4L6E54FINJYP3/action/storage_attestation","attest_author":"https://pith.science/pith/2JU7SAGSVACLG4L6E54FINJYP3/action/author_attestation","sign_citation":"https://pith.science/pith/2JU7SAGSVACLG4L6E54FINJYP3/action/citation_signature","submit_replication":"https://pith.science/pith/2JU7SAGSVACLG4L6E54FINJYP3/action/replication_record"}},"created_at":"2026-05-18T01:02:57.182213+00:00","updated_at":"2026-05-18T01:02:57.182213+00:00"}