{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:3RVNWWO4CKY624CLOX5DCQCD5R","short_pith_number":"pith:3RVNWWO4","schema_version":"1.0","canonical_sha256":"dc6adb59dc12b1ed704b75fa314043ec7ae5ba6292564f3e214a28279216a527","source":{"kind":"arxiv","id":"2106.00701","version":1},"attestation_state":"computed","paper":{"title":"On digraphs with polygonal restricted numerical range","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexander Wiedemann, Ben Small, H. Tracy Hall, Thomas R. Cameron","submitted_at":"2021-06-01T18:01:29Z","abstract_excerpt":"In 2020, Cameron et al. introduced the restricted numerical range of a digraph (directed graph) as a tool for characterizing digraphs and studying their algebraic connectivity. In particular, digraphs with a restricted numerical range of a single point, a horizontal line segment, and a vertical line segment were characterized as $k$-imploding stars, directed joins of bidirectional digraphs, and regular tournaments, respectively. In this article, we extend these results by investigating digraphs whose restricted numerical range is a convex polygon in the complex plane. We provide computational "},"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":"2106.00701","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2021-06-01T18:01:29Z","cross_cats_sorted":[],"title_canon_sha256":"d9cb006c831a0284909aae4485654f8e3e8efed25ac96255e57736214a90c80b","abstract_canon_sha256":"ab3cb29634f38a58cc72549410452b02948c3f49b575930421b315684263f078"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:45:39.135946Z","signature_b64":"GLVWtnxBmSf62OTg3pi9DM5F+FQJ726btYKOcXuTDyY7/dUDuoppCtnKd4/6VGaFHDqEcn79x8YG2ovapNTADQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dc6adb59dc12b1ed704b75fa314043ec7ae5ba6292564f3e214a28279216a527","last_reissued_at":"2026-07-05T02:45:39.135563Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:45:39.135563Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On digraphs with polygonal restricted numerical range","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexander Wiedemann, Ben Small, H. Tracy Hall, Thomas R. Cameron","submitted_at":"2021-06-01T18:01:29Z","abstract_excerpt":"In 2020, Cameron et al. introduced the restricted numerical range of a digraph (directed graph) as a tool for characterizing digraphs and studying their algebraic connectivity. In particular, digraphs with a restricted numerical range of a single point, a horizontal line segment, and a vertical line segment were characterized as $k$-imploding stars, directed joins of bidirectional digraphs, and regular tournaments, respectively. In this article, we extend these results by investigating digraphs whose restricted numerical range is a convex polygon in the complex plane. We provide computational "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.00701","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2106.00701/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":"2106.00701","created_at":"2026-07-05T02:45:39.135617+00:00"},{"alias_kind":"arxiv_version","alias_value":"2106.00701v1","created_at":"2026-07-05T02:45:39.135617+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.00701","created_at":"2026-07-05T02:45:39.135617+00:00"},{"alias_kind":"pith_short_12","alias_value":"3RVNWWO4CKY6","created_at":"2026-07-05T02:45:39.135617+00:00"},{"alias_kind":"pith_short_16","alias_value":"3RVNWWO4CKY624CL","created_at":"2026-07-05T02:45:39.135617+00:00"},{"alias_kind":"pith_short_8","alias_value":"3RVNWWO4","created_at":"2026-07-05T02:45:39.135617+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/3RVNWWO4CKY624CLOX5DCQCD5R","json":"https://pith.science/pith/3RVNWWO4CKY624CLOX5DCQCD5R.json","graph_json":"https://pith.science/api/pith-number/3RVNWWO4CKY624CLOX5DCQCD5R/graph.json","events_json":"https://pith.science/api/pith-number/3RVNWWO4CKY624CLOX5DCQCD5R/events.json","paper":"https://pith.science/paper/3RVNWWO4"},"agent_actions":{"view_html":"https://pith.science/pith/3RVNWWO4CKY624CLOX5DCQCD5R","download_json":"https://pith.science/pith/3RVNWWO4CKY624CLOX5DCQCD5R.json","view_paper":"https://pith.science/paper/3RVNWWO4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2106.00701&json=true","fetch_graph":"https://pith.science/api/pith-number/3RVNWWO4CKY624CLOX5DCQCD5R/graph.json","fetch_events":"https://pith.science/api/pith-number/3RVNWWO4CKY624CLOX5DCQCD5R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3RVNWWO4CKY624CLOX5DCQCD5R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3RVNWWO4CKY624CLOX5DCQCD5R/action/storage_attestation","attest_author":"https://pith.science/pith/3RVNWWO4CKY624CLOX5DCQCD5R/action/author_attestation","sign_citation":"https://pith.science/pith/3RVNWWO4CKY624CLOX5DCQCD5R/action/citation_signature","submit_replication":"https://pith.science/pith/3RVNWWO4CKY624CLOX5DCQCD5R/action/replication_record"}},"created_at":"2026-07-05T02:45:39.135617+00:00","updated_at":"2026-07-05T02:45:39.135617+00:00"}