{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:YXY7AHPAGL3ONAYGR7V2HRMFPF","short_pith_number":"pith:YXY7AHPA","schema_version":"1.0","canonical_sha256":"c5f1f01de032f6e683068feba3c585795d4807954925355f64a02572d1546e99","source":{"kind":"arxiv","id":"1408.1283","version":1},"attestation_state":"computed","paper":{"title":"On the minimal energy of tetracyclic graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hongping Ma, Yongqiang Bai","submitted_at":"2014-08-06T13:59:05Z","abstract_excerpt":"The energy of a graph is defined as the sum of the absolute values of the eigenvalues of its adjacency matrix. In this paper, we characterize the tetracyclic graph of order $n$ with minimal energy. By this, the validity of a conjecture for the case $e=n+3$ proposed by Caporossi et al. \\cite{CCGH} has been confirmed."},"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":"1408.1283","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-08-06T13:59:05Z","cross_cats_sorted":[],"title_canon_sha256":"82f9da2947096571c489831659d6098496124d343cbf1cc1fc237ee9b96c9370","abstract_canon_sha256":"1b1be94180c215355e42888462bde6a1f33c7c2def5ee9070cc9b25a001e2330"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:45:47.675699Z","signature_b64":"Wzker25DeJFvVj7CvO6CwydFTYcpvfBI+hPBkOgaCIqbjagHV8OQ7cr0DAhjdyxlh+1t+eiH5A0DxoAWoBvlBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c5f1f01de032f6e683068feba3c585795d4807954925355f64a02572d1546e99","last_reissued_at":"2026-05-18T02:45:47.675040Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:45:47.675040Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the minimal energy of tetracyclic graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hongping Ma, Yongqiang Bai","submitted_at":"2014-08-06T13:59:05Z","abstract_excerpt":"The energy of a graph is defined as the sum of the absolute values of the eigenvalues of its adjacency matrix. In this paper, we characterize the tetracyclic graph of order $n$ with minimal energy. By this, the validity of a conjecture for the case $e=n+3$ proposed by Caporossi et al. \\cite{CCGH} has been confirmed."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.1283","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":"1408.1283","created_at":"2026-05-18T02:45:47.675157+00:00"},{"alias_kind":"arxiv_version","alias_value":"1408.1283v1","created_at":"2026-05-18T02:45:47.675157+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.1283","created_at":"2026-05-18T02:45:47.675157+00:00"},{"alias_kind":"pith_short_12","alias_value":"YXY7AHPAGL3O","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_16","alias_value":"YXY7AHPAGL3ONAYG","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_8","alias_value":"YXY7AHPA","created_at":"2026-05-18T12:28:59.999130+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/YXY7AHPAGL3ONAYGR7V2HRMFPF","json":"https://pith.science/pith/YXY7AHPAGL3ONAYGR7V2HRMFPF.json","graph_json":"https://pith.science/api/pith-number/YXY7AHPAGL3ONAYGR7V2HRMFPF/graph.json","events_json":"https://pith.science/api/pith-number/YXY7AHPAGL3ONAYGR7V2HRMFPF/events.json","paper":"https://pith.science/paper/YXY7AHPA"},"agent_actions":{"view_html":"https://pith.science/pith/YXY7AHPAGL3ONAYGR7V2HRMFPF","download_json":"https://pith.science/pith/YXY7AHPAGL3ONAYGR7V2HRMFPF.json","view_paper":"https://pith.science/paper/YXY7AHPA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1408.1283&json=true","fetch_graph":"https://pith.science/api/pith-number/YXY7AHPAGL3ONAYGR7V2HRMFPF/graph.json","fetch_events":"https://pith.science/api/pith-number/YXY7AHPAGL3ONAYGR7V2HRMFPF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YXY7AHPAGL3ONAYGR7V2HRMFPF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YXY7AHPAGL3ONAYGR7V2HRMFPF/action/storage_attestation","attest_author":"https://pith.science/pith/YXY7AHPAGL3ONAYGR7V2HRMFPF/action/author_attestation","sign_citation":"https://pith.science/pith/YXY7AHPAGL3ONAYGR7V2HRMFPF/action/citation_signature","submit_replication":"https://pith.science/pith/YXY7AHPAGL3ONAYGR7V2HRMFPF/action/replication_record"}},"created_at":"2026-05-18T02:45:47.675157+00:00","updated_at":"2026-05-18T02:45:47.675157+00:00"}