{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:Q4BOLLUFN6U5GOKO273AK6ZQHU","short_pith_number":"pith:Q4BOLLUF","schema_version":"1.0","canonical_sha256":"8702e5ae856fa9d3394ed7f6057b303d1d177e7d4464fd3c44f1485da918f19e","source":{"kind":"arxiv","id":"1708.08493","version":1},"attestation_state":"computed","paper":{"title":"Peaks on Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexander Diaz-Lopez, Erik Insko, Lucas Everham, Mohamed Omar, Pamela E. Harris, Vincent Marcantonio","submitted_at":"2017-08-28T19:20:28Z","abstract_excerpt":"Given a graph $G$ with $n$ vertices and a bijective labeling of the vertices using the integers $1,2,\\ldots, n$, we say $G$ has a peak at vertex $v$ if the degree of $v$ is greater than or equal to 2, and if the label on $v$ is larger than the label of all its neighbors. Fix an enumeration of the vertices of $G$ as $v_1,v_2,\\ldots, v_{n}$ and a fix a set $S\\subset V(G)$. We want to determine the number of distinct bijective labelings of the vertices of $G$, such that the vertices in $S$ are precisely the peaks of $G$. The set $S$ is called the \\emph{peak set of the graph} $G$, and the set of a"},"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":"1708.08493","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-28T19:20:28Z","cross_cats_sorted":[],"title_canon_sha256":"41fb9400b24e143339e711187673b5297e348932f3f2803ef9922131ab31ceb7","abstract_canon_sha256":"d899463a4aa83c16fc1ee45a03368faff6ff60774c97c313a75ad17a30f252d9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:27.582150Z","signature_b64":"ztLk44MZwgzkmVSsTraIX4JrOCABityTeK1jE9VYFPsDUVDjkwunKZHUdhalE3PxGlCvC4kwsmwux3c4O687AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8702e5ae856fa9d3394ed7f6057b303d1d177e7d4464fd3c44f1485da918f19e","last_reissued_at":"2026-05-18T00:36:27.581498Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:27.581498Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Peaks on Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexander Diaz-Lopez, Erik Insko, Lucas Everham, Mohamed Omar, Pamela E. Harris, Vincent Marcantonio","submitted_at":"2017-08-28T19:20:28Z","abstract_excerpt":"Given a graph $G$ with $n$ vertices and a bijective labeling of the vertices using the integers $1,2,\\ldots, n$, we say $G$ has a peak at vertex $v$ if the degree of $v$ is greater than or equal to 2, and if the label on $v$ is larger than the label of all its neighbors. Fix an enumeration of the vertices of $G$ as $v_1,v_2,\\ldots, v_{n}$ and a fix a set $S\\subset V(G)$. We want to determine the number of distinct bijective labelings of the vertices of $G$, such that the vertices in $S$ are precisely the peaks of $G$. The set $S$ is called the \\emph{peak set of the graph} $G$, and the set of a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.08493","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":"1708.08493","created_at":"2026-05-18T00:36:27.581600+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.08493v1","created_at":"2026-05-18T00:36:27.581600+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.08493","created_at":"2026-05-18T00:36:27.581600+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q4BOLLUFN6U5","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q4BOLLUFN6U5GOKO","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q4BOLLUF","created_at":"2026-05-18T12:31:37.085036+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/Q4BOLLUFN6U5GOKO273AK6ZQHU","json":"https://pith.science/pith/Q4BOLLUFN6U5GOKO273AK6ZQHU.json","graph_json":"https://pith.science/api/pith-number/Q4BOLLUFN6U5GOKO273AK6ZQHU/graph.json","events_json":"https://pith.science/api/pith-number/Q4BOLLUFN6U5GOKO273AK6ZQHU/events.json","paper":"https://pith.science/paper/Q4BOLLUF"},"agent_actions":{"view_html":"https://pith.science/pith/Q4BOLLUFN6U5GOKO273AK6ZQHU","download_json":"https://pith.science/pith/Q4BOLLUFN6U5GOKO273AK6ZQHU.json","view_paper":"https://pith.science/paper/Q4BOLLUF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.08493&json=true","fetch_graph":"https://pith.science/api/pith-number/Q4BOLLUFN6U5GOKO273AK6ZQHU/graph.json","fetch_events":"https://pith.science/api/pith-number/Q4BOLLUFN6U5GOKO273AK6ZQHU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q4BOLLUFN6U5GOKO273AK6ZQHU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q4BOLLUFN6U5GOKO273AK6ZQHU/action/storage_attestation","attest_author":"https://pith.science/pith/Q4BOLLUFN6U5GOKO273AK6ZQHU/action/author_attestation","sign_citation":"https://pith.science/pith/Q4BOLLUFN6U5GOKO273AK6ZQHU/action/citation_signature","submit_replication":"https://pith.science/pith/Q4BOLLUFN6U5GOKO273AK6ZQHU/action/replication_record"}},"created_at":"2026-05-18T00:36:27.581600+00:00","updated_at":"2026-05-18T00:36:27.581600+00:00"}