{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:DUYKP4ESOSWL3K6PF4H2D5LCB3","short_pith_number":"pith:DUYKP4ES","schema_version":"1.0","canonical_sha256":"1d30a7f09274acbdabcf2f0fa1f5620ec09c14172fe6204ae661878d6beddddf","source":{"kind":"arxiv","id":"1506.07031","version":1},"attestation_state":"computed","paper":{"title":"Weighted Automata and Logics for Infinite Nested Words","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.FL","authors_text":"Manfred Droste, Stefan D\\\"uck","submitted_at":"2015-06-23T14:39:21Z","abstract_excerpt":"Nested words introduced by Alur and Madhusudan are used to capture structures with both linear and hierarchical order, e.g. XML documents, without losing valuable closure properties. Furthermore, Alur and Madhusudan introduced automata and equivalent logics for both finite and infinite nested words, thus extending B\\\"uchi's theorem to nested words. Recently, average and discounted computations of weights in quantitative systems found much interest. Here, we will introduce and investigate weighted automata models and weighted MSO logics for infinite nested words. As weight structures we conside"},"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.07031","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-06-23T14:39:21Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"955849c4812734a35746a0851e4f4b64be749dfceb2911c73fd027ce39ed55bd","abstract_canon_sha256":"3c2653ed87bbbd05bb90c1f6afc01752e7f722fe26f9191d4cf8ce54d1ad4c79"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:40:55.268387Z","signature_b64":"AZ+GJZsRhdXXavrRtxOIQBGenwvDn0ksrJPJT6K40zr/9mvU6YsMVWQ0X72eYwAqpLak1WFU7Abe0KJ2TZGWAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1d30a7f09274acbdabcf2f0fa1f5620ec09c14172fe6204ae661878d6beddddf","last_reissued_at":"2026-05-18T01:40:55.267799Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:40:55.267799Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Weighted Automata and Logics for Infinite Nested Words","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.FL","authors_text":"Manfred Droste, Stefan D\\\"uck","submitted_at":"2015-06-23T14:39:21Z","abstract_excerpt":"Nested words introduced by Alur and Madhusudan are used to capture structures with both linear and hierarchical order, e.g. XML documents, without losing valuable closure properties. Furthermore, Alur and Madhusudan introduced automata and equivalent logics for both finite and infinite nested words, thus extending B\\\"uchi's theorem to nested words. Recently, average and discounted computations of weights in quantitative systems found much interest. Here, we will introduce and investigate weighted automata models and weighted MSO logics for infinite nested words. As weight structures we conside"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.07031","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.07031","created_at":"2026-05-18T01:40:55.267888+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.07031v1","created_at":"2026-05-18T01:40:55.267888+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.07031","created_at":"2026-05-18T01:40:55.267888+00:00"},{"alias_kind":"pith_short_12","alias_value":"DUYKP4ESOSWL","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_16","alias_value":"DUYKP4ESOSWL3K6P","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_8","alias_value":"DUYKP4ES","created_at":"2026-05-18T12:29:17.054201+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/DUYKP4ESOSWL3K6PF4H2D5LCB3","json":"https://pith.science/pith/DUYKP4ESOSWL3K6PF4H2D5LCB3.json","graph_json":"https://pith.science/api/pith-number/DUYKP4ESOSWL3K6PF4H2D5LCB3/graph.json","events_json":"https://pith.science/api/pith-number/DUYKP4ESOSWL3K6PF4H2D5LCB3/events.json","paper":"https://pith.science/paper/DUYKP4ES"},"agent_actions":{"view_html":"https://pith.science/pith/DUYKP4ESOSWL3K6PF4H2D5LCB3","download_json":"https://pith.science/pith/DUYKP4ESOSWL3K6PF4H2D5LCB3.json","view_paper":"https://pith.science/paper/DUYKP4ES","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.07031&json=true","fetch_graph":"https://pith.science/api/pith-number/DUYKP4ESOSWL3K6PF4H2D5LCB3/graph.json","fetch_events":"https://pith.science/api/pith-number/DUYKP4ESOSWL3K6PF4H2D5LCB3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DUYKP4ESOSWL3K6PF4H2D5LCB3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DUYKP4ESOSWL3K6PF4H2D5LCB3/action/storage_attestation","attest_author":"https://pith.science/pith/DUYKP4ESOSWL3K6PF4H2D5LCB3/action/author_attestation","sign_citation":"https://pith.science/pith/DUYKP4ESOSWL3K6PF4H2D5LCB3/action/citation_signature","submit_replication":"https://pith.science/pith/DUYKP4ESOSWL3K6PF4H2D5LCB3/action/replication_record"}},"created_at":"2026-05-18T01:40:55.267888+00:00","updated_at":"2026-05-18T01:40:55.267888+00:00"}