{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:NHLYCCXEP5I4NLXL2FLUHIQRCS","short_pith_number":"pith:NHLYCCXE","schema_version":"1.0","canonical_sha256":"69d7810ae47f51c6aeebd15743a21114a7bf9d4f3bcf4291b212784aa1f1c147","source":{"kind":"arxiv","id":"1303.2304","version":2},"attestation_state":"computed","paper":{"title":"On Milgram's construction and the Duke embedding conjectures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Timothy Sun","submitted_at":"2013-03-10T10:04:00Z","abstract_excerpt":"Milgram constructed a 28-vertex cubic graph of genus 4 that disproved Duke's conjecture relating Betti number to minimum genus. We apply Milgram's method to construct to find graphs of higher genus violating Duke's conjecture, which gives a sharper bound on that relationship. These graphs are also counterexamples to a related conjecture of Nordhaus et al. on the relationship between minimum and maximum genera of graphs. As a side note, we give a simpler proof of correctness for Milgram's method and we show that Duke's conjecture is true for genus at most 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":"1303.2304","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-03-10T10:04:00Z","cross_cats_sorted":[],"title_canon_sha256":"2a02c86b4af5ee0ac9e6a2fc002cd3879526f42b3ab5e5158555b7a19a7afe2a","abstract_canon_sha256":"1f93a001a45c98e00d8d4912559f02f56d8411c9b660d2ee3ba95e647fd8078d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:27:42.476672Z","signature_b64":"DU+70jRPQFve3yvHG50D1WeQgq4GNibhb7iD6EuCalH6UZXVmnNlpHc36/U5l/FNNVo+6Q7bU0/dY2SK02WnAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"69d7810ae47f51c6aeebd15743a21114a7bf9d4f3bcf4291b212784aa1f1c147","last_reissued_at":"2026-05-18T03:27:42.476002Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:27:42.476002Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Milgram's construction and the Duke embedding conjectures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Timothy Sun","submitted_at":"2013-03-10T10:04:00Z","abstract_excerpt":"Milgram constructed a 28-vertex cubic graph of genus 4 that disproved Duke's conjecture relating Betti number to minimum genus. We apply Milgram's method to construct to find graphs of higher genus violating Duke's conjecture, which gives a sharper bound on that relationship. These graphs are also counterexamples to a related conjecture of Nordhaus et al. on the relationship between minimum and maximum genera of graphs. As a side note, we give a simpler proof of correctness for Milgram's method and we show that Duke's conjecture is true for genus at most 3."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.2304","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":"1303.2304","created_at":"2026-05-18T03:27:42.476097+00:00"},{"alias_kind":"arxiv_version","alias_value":"1303.2304v2","created_at":"2026-05-18T03:27:42.476097+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.2304","created_at":"2026-05-18T03:27:42.476097+00:00"},{"alias_kind":"pith_short_12","alias_value":"NHLYCCXEP5I4","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_16","alias_value":"NHLYCCXEP5I4NLXL","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_8","alias_value":"NHLYCCXE","created_at":"2026-05-18T12:27:52.871228+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/NHLYCCXEP5I4NLXL2FLUHIQRCS","json":"https://pith.science/pith/NHLYCCXEP5I4NLXL2FLUHIQRCS.json","graph_json":"https://pith.science/api/pith-number/NHLYCCXEP5I4NLXL2FLUHIQRCS/graph.json","events_json":"https://pith.science/api/pith-number/NHLYCCXEP5I4NLXL2FLUHIQRCS/events.json","paper":"https://pith.science/paper/NHLYCCXE"},"agent_actions":{"view_html":"https://pith.science/pith/NHLYCCXEP5I4NLXL2FLUHIQRCS","download_json":"https://pith.science/pith/NHLYCCXEP5I4NLXL2FLUHIQRCS.json","view_paper":"https://pith.science/paper/NHLYCCXE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1303.2304&json=true","fetch_graph":"https://pith.science/api/pith-number/NHLYCCXEP5I4NLXL2FLUHIQRCS/graph.json","fetch_events":"https://pith.science/api/pith-number/NHLYCCXEP5I4NLXL2FLUHIQRCS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NHLYCCXEP5I4NLXL2FLUHIQRCS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NHLYCCXEP5I4NLXL2FLUHIQRCS/action/storage_attestation","attest_author":"https://pith.science/pith/NHLYCCXEP5I4NLXL2FLUHIQRCS/action/author_attestation","sign_citation":"https://pith.science/pith/NHLYCCXEP5I4NLXL2FLUHIQRCS/action/citation_signature","submit_replication":"https://pith.science/pith/NHLYCCXEP5I4NLXL2FLUHIQRCS/action/replication_record"}},"created_at":"2026-05-18T03:27:42.476097+00:00","updated_at":"2026-05-18T03:27:42.476097+00:00"}