{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:MV6VIOPYFHARUYYUYD23KQHCY5","short_pith_number":"pith:MV6VIOPY","schema_version":"1.0","canonical_sha256":"657d5439f829c11a6314c0f5b540e2c74b5e775eea996700674f89e0b086f5ff","source":{"kind":"arxiv","id":"1207.1802","version":2},"attestation_state":"computed","paper":{"title":"Integral trees with given nullity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"A. Mohammadian, B. Tayfeh-Rezaie, E. Ghorbani","submitted_at":"2012-07-07T15:13:37Z","abstract_excerpt":"A graph is called integral if all eigenvalues of its adjacency matrix consist entirely of integers. We prove that for a given nullity more than 1, there are only finitely many integral trees. It is also shown that integral trees with nullity 2 and 3 are unique."},"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":"1207.1802","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-07-07T15:13:37Z","cross_cats_sorted":[],"title_canon_sha256":"e36ce2f899201ffa2bacf88d47dca75fda36204744cf6dd2763f8685c0763405","abstract_canon_sha256":"1b6f0f8871f420698dba07a43b5e28724252682ad3127dc2f7f020578f3b517b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:18:04.551776Z","signature_b64":"YXrMNp74NXHg8JBh+4kzAogUOUpE101SRNF8j4L0P/ZTXVPYUYYDtl+iH8Pqi+WPrRxee7RWxRnL1/laTo1DCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"657d5439f829c11a6314c0f5b540e2c74b5e775eea996700674f89e0b086f5ff","last_reissued_at":"2026-05-18T02:18:04.551027Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:18:04.551027Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Integral trees with given nullity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"A. Mohammadian, B. Tayfeh-Rezaie, E. Ghorbani","submitted_at":"2012-07-07T15:13:37Z","abstract_excerpt":"A graph is called integral if all eigenvalues of its adjacency matrix consist entirely of integers. We prove that for a given nullity more than 1, there are only finitely many integral trees. It is also shown that integral trees with nullity 2 and 3 are unique."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.1802","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":"1207.1802","created_at":"2026-05-18T02:18:04.551131+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.1802v2","created_at":"2026-05-18T02:18:04.551131+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.1802","created_at":"2026-05-18T02:18:04.551131+00:00"},{"alias_kind":"pith_short_12","alias_value":"MV6VIOPYFHAR","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_16","alias_value":"MV6VIOPYFHARUYYU","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_8","alias_value":"MV6VIOPY","created_at":"2026-05-18T12:27:14.488303+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/MV6VIOPYFHARUYYUYD23KQHCY5","json":"https://pith.science/pith/MV6VIOPYFHARUYYUYD23KQHCY5.json","graph_json":"https://pith.science/api/pith-number/MV6VIOPYFHARUYYUYD23KQHCY5/graph.json","events_json":"https://pith.science/api/pith-number/MV6VIOPYFHARUYYUYD23KQHCY5/events.json","paper":"https://pith.science/paper/MV6VIOPY"},"agent_actions":{"view_html":"https://pith.science/pith/MV6VIOPYFHARUYYUYD23KQHCY5","download_json":"https://pith.science/pith/MV6VIOPYFHARUYYUYD23KQHCY5.json","view_paper":"https://pith.science/paper/MV6VIOPY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.1802&json=true","fetch_graph":"https://pith.science/api/pith-number/MV6VIOPYFHARUYYUYD23KQHCY5/graph.json","fetch_events":"https://pith.science/api/pith-number/MV6VIOPYFHARUYYUYD23KQHCY5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MV6VIOPYFHARUYYUYD23KQHCY5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MV6VIOPYFHARUYYUYD23KQHCY5/action/storage_attestation","attest_author":"https://pith.science/pith/MV6VIOPYFHARUYYUYD23KQHCY5/action/author_attestation","sign_citation":"https://pith.science/pith/MV6VIOPYFHARUYYUYD23KQHCY5/action/citation_signature","submit_replication":"https://pith.science/pith/MV6VIOPYFHARUYYUYD23KQHCY5/action/replication_record"}},"created_at":"2026-05-18T02:18:04.551131+00:00","updated_at":"2026-05-18T02:18:04.551131+00:00"}