{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:3RQZAGYW57YXH73ZAV2BCNCNWB","short_pith_number":"pith:3RQZAGYW","schema_version":"1.0","canonical_sha256":"dc61901b16eff173ff79057411344db0654eaf2fc149cf45f5d63c602394f54c","source":{"kind":"arxiv","id":"2308.10978","version":2},"attestation_state":"computed","paper":{"title":"Triangle-degree and triangle-distinct graphs","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Beth Bjorkman, Danny Rorabaugh, Heather Smith Blake, Kevin Moss, Lauren Keough, Sogol Jahanbekam, Songling Shan, Zhanar Berikkyzy","submitted_at":"2023-08-21T18:54:17Z","abstract_excerpt":"Let $G$ be a simple graph and $v$ be a vertex of $G$. The triangle-degree of $v$ in $G$ is the number of triangles that contain $v$. While every graph has at least two vertices with the same degree, there are graphs in which every vertex has a distinct triangle-degree. In this paper, we construct an infinite family of graphs with this property. We also study the vertex degrees and size of graphs with this property."},"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":"2308.10978","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2023-08-21T18:54:17Z","cross_cats_sorted":[],"title_canon_sha256":"256c28142a2427e486972001c46a6364d06aec32e91f760ec06c69c52c9a9398","abstract_canon_sha256":"001bd14ced92916d6a9c2edfc44b7ef93f71914a816ef3159a4d5db972efaf2f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:46:07.580827Z","signature_b64":"9GeLEAgMgK+xtt7Q9+nSw/QcA7aopgYXm8/e8W8GIVKGTtVckpKRsDBpEv1nqt0RKiMHKrupb1CLLTzA4e6dCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dc61901b16eff173ff79057411344db0654eaf2fc149cf45f5d63c602394f54c","last_reissued_at":"2026-07-05T06:46:07.580335Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:46:07.580335Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Triangle-degree and triangle-distinct graphs","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Beth Bjorkman, Danny Rorabaugh, Heather Smith Blake, Kevin Moss, Lauren Keough, Sogol Jahanbekam, Songling Shan, Zhanar Berikkyzy","submitted_at":"2023-08-21T18:54:17Z","abstract_excerpt":"Let $G$ be a simple graph and $v$ be a vertex of $G$. The triangle-degree of $v$ in $G$ is the number of triangles that contain $v$. While every graph has at least two vertices with the same degree, there are graphs in which every vertex has a distinct triangle-degree. In this paper, we construct an infinite family of graphs with this property. We also study the vertex degrees and size of graphs with this property."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.10978","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2308.10978/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":"2308.10978","created_at":"2026-07-05T06:46:07.580391+00:00"},{"alias_kind":"arxiv_version","alias_value":"2308.10978v2","created_at":"2026-07-05T06:46:07.580391+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.10978","created_at":"2026-07-05T06:46:07.580391+00:00"},{"alias_kind":"pith_short_12","alias_value":"3RQZAGYW57YX","created_at":"2026-07-05T06:46:07.580391+00:00"},{"alias_kind":"pith_short_16","alias_value":"3RQZAGYW57YXH73Z","created_at":"2026-07-05T06:46:07.580391+00:00"},{"alias_kind":"pith_short_8","alias_value":"3RQZAGYW","created_at":"2026-07-05T06:46:07.580391+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/3RQZAGYW57YXH73ZAV2BCNCNWB","json":"https://pith.science/pith/3RQZAGYW57YXH73ZAV2BCNCNWB.json","graph_json":"https://pith.science/api/pith-number/3RQZAGYW57YXH73ZAV2BCNCNWB/graph.json","events_json":"https://pith.science/api/pith-number/3RQZAGYW57YXH73ZAV2BCNCNWB/events.json","paper":"https://pith.science/paper/3RQZAGYW"},"agent_actions":{"view_html":"https://pith.science/pith/3RQZAGYW57YXH73ZAV2BCNCNWB","download_json":"https://pith.science/pith/3RQZAGYW57YXH73ZAV2BCNCNWB.json","view_paper":"https://pith.science/paper/3RQZAGYW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2308.10978&json=true","fetch_graph":"https://pith.science/api/pith-number/3RQZAGYW57YXH73ZAV2BCNCNWB/graph.json","fetch_events":"https://pith.science/api/pith-number/3RQZAGYW57YXH73ZAV2BCNCNWB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3RQZAGYW57YXH73ZAV2BCNCNWB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3RQZAGYW57YXH73ZAV2BCNCNWB/action/storage_attestation","attest_author":"https://pith.science/pith/3RQZAGYW57YXH73ZAV2BCNCNWB/action/author_attestation","sign_citation":"https://pith.science/pith/3RQZAGYW57YXH73ZAV2BCNCNWB/action/citation_signature","submit_replication":"https://pith.science/pith/3RQZAGYW57YXH73ZAV2BCNCNWB/action/replication_record"}},"created_at":"2026-07-05T06:46:07.580391+00:00","updated_at":"2026-07-05T06:46:07.580391+00:00"}