{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:AYROEHHX4LTMTAUHK2XMG6NP7O","short_pith_number":"pith:AYROEHHX","schema_version":"1.0","canonical_sha256":"0622e21cf7e2e6c9828756aec379affb9b451c5872bc5dcaa8283c5df203bfb5","source":{"kind":"arxiv","id":"1111.7246","version":1},"attestation_state":"computed","paper":{"title":"The Laplacian lattice of a graph under a simplicial distance function","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Madhusudan Manjunath","submitted_at":"2011-11-30T17:38:17Z","abstract_excerpt":"We provide a complete description of important geometric invariants of the Laplacian lattice of a multigraph under the distance function induced by a regular simplex, namely Voronoi Diagram, Delaunay Triangulation, Delaunay Polytope and its combinatorial structure, Shortest Vectors, Covering and Packing Radius. We use this information to obtain the following results: i. Every multigraph defines a Delaunay triangulation of its Laplacian lattice and this Delaunay triangulation contains complete information of the multigraph up to isomorphism. ii. The number of multigraphs with a given Laplacian "},"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":"1111.7246","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-11-30T17:38:17Z","cross_cats_sorted":[],"title_canon_sha256":"6f5f3b347b0dd5986b377bef33b8a56bdc04ae19d66f9348910ce2c1487228ea","abstract_canon_sha256":"6fa1ce733c6b8f1d708c98b003f3748b8b80aabc67dd180a67bc4ea6cc79622c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:07:18.332100Z","signature_b64":"nx7L1IP4RKmlNlJzkmlqCm/4DMpEI7DmxWiQorjYMwHr+vntkqdTU7sYcv9Clt50QxOKHh0WjO9agwW/EfyEBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0622e21cf7e2e6c9828756aec379affb9b451c5872bc5dcaa8283c5df203bfb5","last_reissued_at":"2026-05-18T04:07:18.331408Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:07:18.331408Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Laplacian lattice of a graph under a simplicial distance function","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Madhusudan Manjunath","submitted_at":"2011-11-30T17:38:17Z","abstract_excerpt":"We provide a complete description of important geometric invariants of the Laplacian lattice of a multigraph under the distance function induced by a regular simplex, namely Voronoi Diagram, Delaunay Triangulation, Delaunay Polytope and its combinatorial structure, Shortest Vectors, Covering and Packing Radius. We use this information to obtain the following results: i. Every multigraph defines a Delaunay triangulation of its Laplacian lattice and this Delaunay triangulation contains complete information of the multigraph up to isomorphism. ii. The number of multigraphs with a given Laplacian "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.7246","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":"1111.7246","created_at":"2026-05-18T04:07:18.331523+00:00"},{"alias_kind":"arxiv_version","alias_value":"1111.7246v1","created_at":"2026-05-18T04:07:18.331523+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.7246","created_at":"2026-05-18T04:07:18.331523+00:00"},{"alias_kind":"pith_short_12","alias_value":"AYROEHHX4LTM","created_at":"2026-05-18T12:26:24.575870+00:00"},{"alias_kind":"pith_short_16","alias_value":"AYROEHHX4LTMTAUH","created_at":"2026-05-18T12:26:24.575870+00:00"},{"alias_kind":"pith_short_8","alias_value":"AYROEHHX","created_at":"2026-05-18T12:26:24.575870+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/AYROEHHX4LTMTAUHK2XMG6NP7O","json":"https://pith.science/pith/AYROEHHX4LTMTAUHK2XMG6NP7O.json","graph_json":"https://pith.science/api/pith-number/AYROEHHX4LTMTAUHK2XMG6NP7O/graph.json","events_json":"https://pith.science/api/pith-number/AYROEHHX4LTMTAUHK2XMG6NP7O/events.json","paper":"https://pith.science/paper/AYROEHHX"},"agent_actions":{"view_html":"https://pith.science/pith/AYROEHHX4LTMTAUHK2XMG6NP7O","download_json":"https://pith.science/pith/AYROEHHX4LTMTAUHK2XMG6NP7O.json","view_paper":"https://pith.science/paper/AYROEHHX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1111.7246&json=true","fetch_graph":"https://pith.science/api/pith-number/AYROEHHX4LTMTAUHK2XMG6NP7O/graph.json","fetch_events":"https://pith.science/api/pith-number/AYROEHHX4LTMTAUHK2XMG6NP7O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AYROEHHX4LTMTAUHK2XMG6NP7O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AYROEHHX4LTMTAUHK2XMG6NP7O/action/storage_attestation","attest_author":"https://pith.science/pith/AYROEHHX4LTMTAUHK2XMG6NP7O/action/author_attestation","sign_citation":"https://pith.science/pith/AYROEHHX4LTMTAUHK2XMG6NP7O/action/citation_signature","submit_replication":"https://pith.science/pith/AYROEHHX4LTMTAUHK2XMG6NP7O/action/replication_record"}},"created_at":"2026-05-18T04:07:18.331523+00:00","updated_at":"2026-05-18T04:07:18.331523+00:00"}