{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:6U3JQVNFNGLDMQ64OKY3E7JM2I","short_pith_number":"pith:6U3JQVNF","schema_version":"1.0","canonical_sha256":"f5369855a569963643dc72b1b27d2cd2063c9369395f5af4e601a18ead5e1c49","source":{"kind":"arxiv","id":"1712.07559","version":1},"attestation_state":"computed","paper":{"title":"Recognizing Generalized Transmission Graphs of Line Segments and Circular Sectors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Katharina Klost, Wolfgang Mulzer","submitted_at":"2017-12-20T16:29:15Z","abstract_excerpt":"Suppose we have an arrangement $\\mathcal{A}$ of $n$ geometric objects $x_1, \\dots, x_n \\subseteq \\mathbb{R}^2$ in the plane, with a distinguished point $p_i$ in each object $x_i$. The generalized transmission graph of $\\mathcal{A}$ has vertex set $\\{x_1, \\dots, x_n\\}$ and a directed edge $x_ix_j$ if and only if $p_j \\in x_i$. Generalized transmission graphs provide a generalized model of the connectivity in networks of directional antennas.\n  The complexity class $\\exists \\mathbb{R}$ contains all problems that can be reduced in polynomial time to an existential sentence of the form $\\exists x_"},"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":"1712.07559","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-12-20T16:29:15Z","cross_cats_sorted":[],"title_canon_sha256":"3a4b73ed42b03c864f220dcb674f35048f9ddee3ce834f1e50a9ae5fae379edc","abstract_canon_sha256":"7a0af128ca5e3dac000df9afe2787d5254869beb7ec3ce3af82fd5f26a88b6ad"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:34.222806Z","signature_b64":"tymWvFyfAFBztNcOyAFCDVKceKmAabQvl8Ukd2sXemVKd/Civz0uFOIWLZuTY0Cekw4GU2rpTdmcPtPUNYszDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f5369855a569963643dc72b1b27d2cd2063c9369395f5af4e601a18ead5e1c49","last_reissued_at":"2026-05-18T00:27:34.222257Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:34.222257Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Recognizing Generalized Transmission Graphs of Line Segments and Circular Sectors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Katharina Klost, Wolfgang Mulzer","submitted_at":"2017-12-20T16:29:15Z","abstract_excerpt":"Suppose we have an arrangement $\\mathcal{A}$ of $n$ geometric objects $x_1, \\dots, x_n \\subseteq \\mathbb{R}^2$ in the plane, with a distinguished point $p_i$ in each object $x_i$. The generalized transmission graph of $\\mathcal{A}$ has vertex set $\\{x_1, \\dots, x_n\\}$ and a directed edge $x_ix_j$ if and only if $p_j \\in x_i$. Generalized transmission graphs provide a generalized model of the connectivity in networks of directional antennas.\n  The complexity class $\\exists \\mathbb{R}$ contains all problems that can be reduced in polynomial time to an existential sentence of the form $\\exists x_"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.07559","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":"1712.07559","created_at":"2026-05-18T00:27:34.222340+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.07559v1","created_at":"2026-05-18T00:27:34.222340+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.07559","created_at":"2026-05-18T00:27:34.222340+00:00"},{"alias_kind":"pith_short_12","alias_value":"6U3JQVNFNGLD","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_16","alias_value":"6U3JQVNFNGLDMQ64","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_8","alias_value":"6U3JQVNF","created_at":"2026-05-18T12:31:03.183658+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/6U3JQVNFNGLDMQ64OKY3E7JM2I","json":"https://pith.science/pith/6U3JQVNFNGLDMQ64OKY3E7JM2I.json","graph_json":"https://pith.science/api/pith-number/6U3JQVNFNGLDMQ64OKY3E7JM2I/graph.json","events_json":"https://pith.science/api/pith-number/6U3JQVNFNGLDMQ64OKY3E7JM2I/events.json","paper":"https://pith.science/paper/6U3JQVNF"},"agent_actions":{"view_html":"https://pith.science/pith/6U3JQVNFNGLDMQ64OKY3E7JM2I","download_json":"https://pith.science/pith/6U3JQVNFNGLDMQ64OKY3E7JM2I.json","view_paper":"https://pith.science/paper/6U3JQVNF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.07559&json=true","fetch_graph":"https://pith.science/api/pith-number/6U3JQVNFNGLDMQ64OKY3E7JM2I/graph.json","fetch_events":"https://pith.science/api/pith-number/6U3JQVNFNGLDMQ64OKY3E7JM2I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6U3JQVNFNGLDMQ64OKY3E7JM2I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6U3JQVNFNGLDMQ64OKY3E7JM2I/action/storage_attestation","attest_author":"https://pith.science/pith/6U3JQVNFNGLDMQ64OKY3E7JM2I/action/author_attestation","sign_citation":"https://pith.science/pith/6U3JQVNFNGLDMQ64OKY3E7JM2I/action/citation_signature","submit_replication":"https://pith.science/pith/6U3JQVNFNGLDMQ64OKY3E7JM2I/action/replication_record"}},"created_at":"2026-05-18T00:27:34.222340+00:00","updated_at":"2026-05-18T00:27:34.222340+00:00"}