{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:DNPFJ2Q5UG3IUU2GDZMNAABWEI","short_pith_number":"pith:DNPFJ2Q5","schema_version":"1.0","canonical_sha256":"1b5e54ea1da1b68a53461e58d0003622260d8c39c692491340d9f0ca642da8f7","source":{"kind":"arxiv","id":"1808.09962","version":2},"attestation_state":"computed","paper":{"title":"On the transmission of uniform unicyclic hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bo Zhou, Hongying Lin","submitted_at":"2018-08-29T13:19:07Z","abstract_excerpt":"The transmission of a connected hypergraph is defined as the summation of distances between all unordered pairs of distinct vertices. We determine the unique uniform unicyclic hypergraphs of fixed size with minimum and maximum transmissions, respectively."},"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":"1808.09962","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-29T13:19:07Z","cross_cats_sorted":[],"title_canon_sha256":"e21adf4ba439121fa5e6e546e683ab24b5e6bfa6f9d9b8b7306df8a4428d7d58","abstract_canon_sha256":"fe9f7e2ed2da8afab2599de788c7e14187c9db01e1c89962312625f55f260120"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:24.728572Z","signature_b64":"rRs0tSACMx6JCwMzymIpXrLU90qAZKsBZpJ+8p4/laF+1C8jyvXfXntggWoxFaetRO2mvAJwFo/m2LLe+4cxDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1b5e54ea1da1b68a53461e58d0003622260d8c39c692491340d9f0ca642da8f7","last_reissued_at":"2026-05-18T00:02:24.727909Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:24.727909Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the transmission of uniform unicyclic hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bo Zhou, Hongying Lin","submitted_at":"2018-08-29T13:19:07Z","abstract_excerpt":"The transmission of a connected hypergraph is defined as the summation of distances between all unordered pairs of distinct vertices. We determine the unique uniform unicyclic hypergraphs of fixed size with minimum and maximum transmissions, respectively."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.09962","kind":"arxiv","version":2},"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":"1808.09962","created_at":"2026-05-18T00:02:24.727998+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.09962v2","created_at":"2026-05-18T00:02:24.727998+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.09962","created_at":"2026-05-18T00:02:24.727998+00:00"},{"alias_kind":"pith_short_12","alias_value":"DNPFJ2Q5UG3I","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_16","alias_value":"DNPFJ2Q5UG3IUU2G","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_8","alias_value":"DNPFJ2Q5","created_at":"2026-05-18T12:32:19.392346+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/DNPFJ2Q5UG3IUU2GDZMNAABWEI","json":"https://pith.science/pith/DNPFJ2Q5UG3IUU2GDZMNAABWEI.json","graph_json":"https://pith.science/api/pith-number/DNPFJ2Q5UG3IUU2GDZMNAABWEI/graph.json","events_json":"https://pith.science/api/pith-number/DNPFJ2Q5UG3IUU2GDZMNAABWEI/events.json","paper":"https://pith.science/paper/DNPFJ2Q5"},"agent_actions":{"view_html":"https://pith.science/pith/DNPFJ2Q5UG3IUU2GDZMNAABWEI","download_json":"https://pith.science/pith/DNPFJ2Q5UG3IUU2GDZMNAABWEI.json","view_paper":"https://pith.science/paper/DNPFJ2Q5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.09962&json=true","fetch_graph":"https://pith.science/api/pith-number/DNPFJ2Q5UG3IUU2GDZMNAABWEI/graph.json","fetch_events":"https://pith.science/api/pith-number/DNPFJ2Q5UG3IUU2GDZMNAABWEI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DNPFJ2Q5UG3IUU2GDZMNAABWEI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DNPFJ2Q5UG3IUU2GDZMNAABWEI/action/storage_attestation","attest_author":"https://pith.science/pith/DNPFJ2Q5UG3IUU2GDZMNAABWEI/action/author_attestation","sign_citation":"https://pith.science/pith/DNPFJ2Q5UG3IUU2GDZMNAABWEI/action/citation_signature","submit_replication":"https://pith.science/pith/DNPFJ2Q5UG3IUU2GDZMNAABWEI/action/replication_record"}},"created_at":"2026-05-18T00:02:24.727998+00:00","updated_at":"2026-05-18T00:02:24.727998+00:00"}