{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:3PWWTXFG3NBCI4VYVBY5LFGDUO","short_pith_number":"pith:3PWWTXFG","schema_version":"1.0","canonical_sha256":"dbed69dca6db422472b8a871d594c3a39c775d6a1e7875f5430e8ca173594c86","source":{"kind":"arxiv","id":"1608.08045","version":1},"attestation_state":"computed","paper":{"title":"Connectedness of the dart digraph and the squared-dart digraph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Primo\\v{z} Poto\\v{c}nik, Steve Wilson","submitted_at":"2016-08-29T13:48:19Z","abstract_excerpt":"In this note we revisit the dart graph and the squared dart digraph constructions and prove that they yield strongly connected digraphs when applied to connected graphs of minimum valence at least 3."},"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":"1608.08045","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-29T13:48:19Z","cross_cats_sorted":[],"title_canon_sha256":"2eb4d3388992af4e385cc258f12351140b72d1219858de5c79421e204b4628a2","abstract_canon_sha256":"a8854bada670d617ff505b44601990ef30d5a3b9a2bd869464e484e502d28056"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:07:49.251758Z","signature_b64":"Und0YqpyjqG7K0LyYP58vMoQaUdoex8rukhBESth/IVzyAeynNNy46yUiXo6s0i24b0jwIMo8K0f2NtXUfj6DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dbed69dca6db422472b8a871d594c3a39c775d6a1e7875f5430e8ca173594c86","last_reissued_at":"2026-05-18T01:07:49.251261Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:07:49.251261Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Connectedness of the dart digraph and the squared-dart digraph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Primo\\v{z} Poto\\v{c}nik, Steve Wilson","submitted_at":"2016-08-29T13:48:19Z","abstract_excerpt":"In this note we revisit the dart graph and the squared dart digraph constructions and prove that they yield strongly connected digraphs when applied to connected graphs of minimum valence at least 3."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.08045","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":"1608.08045","created_at":"2026-05-18T01:07:49.251352+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.08045v1","created_at":"2026-05-18T01:07:49.251352+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.08045","created_at":"2026-05-18T01:07:49.251352+00:00"},{"alias_kind":"pith_short_12","alias_value":"3PWWTXFG3NBC","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_16","alias_value":"3PWWTXFG3NBCI4VY","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_8","alias_value":"3PWWTXFG","created_at":"2026-05-18T12:29:55.572404+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/3PWWTXFG3NBCI4VYVBY5LFGDUO","json":"https://pith.science/pith/3PWWTXFG3NBCI4VYVBY5LFGDUO.json","graph_json":"https://pith.science/api/pith-number/3PWWTXFG3NBCI4VYVBY5LFGDUO/graph.json","events_json":"https://pith.science/api/pith-number/3PWWTXFG3NBCI4VYVBY5LFGDUO/events.json","paper":"https://pith.science/paper/3PWWTXFG"},"agent_actions":{"view_html":"https://pith.science/pith/3PWWTXFG3NBCI4VYVBY5LFGDUO","download_json":"https://pith.science/pith/3PWWTXFG3NBCI4VYVBY5LFGDUO.json","view_paper":"https://pith.science/paper/3PWWTXFG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.08045&json=true","fetch_graph":"https://pith.science/api/pith-number/3PWWTXFG3NBCI4VYVBY5LFGDUO/graph.json","fetch_events":"https://pith.science/api/pith-number/3PWWTXFG3NBCI4VYVBY5LFGDUO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3PWWTXFG3NBCI4VYVBY5LFGDUO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3PWWTXFG3NBCI4VYVBY5LFGDUO/action/storage_attestation","attest_author":"https://pith.science/pith/3PWWTXFG3NBCI4VYVBY5LFGDUO/action/author_attestation","sign_citation":"https://pith.science/pith/3PWWTXFG3NBCI4VYVBY5LFGDUO/action/citation_signature","submit_replication":"https://pith.science/pith/3PWWTXFG3NBCI4VYVBY5LFGDUO/action/replication_record"}},"created_at":"2026-05-18T01:07:49.251352+00:00","updated_at":"2026-05-18T01:07:49.251352+00:00"}