{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:QQAYMYMWXMA7U2DD5QQLHQKKWA","short_pith_number":"pith:QQAYMYMW","schema_version":"1.0","canonical_sha256":"8401866196bb01fa6863ec20b3c14ab034de1520004bdff98ad2b88d84a01e11","source":{"kind":"arxiv","id":"1303.3082","version":1},"attestation_state":"computed","paper":{"title":"On Adjacency Matrices and Descriptors of Signed Cycle Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"A.M. Mathai, Thomas Zaslavsky","submitted_at":"2013-03-13T03:33:53Z","abstract_excerpt":"This paper deals with adjacency matrices of signed cycle graphs and chemical descriptors based on them. The eigenvalues and eigenvectors of the matrices are calculated and their efficacy in classifying different signed cycles is determined. The efficacy of some numerical indices is also examined."},"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.3082","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-03-13T03:33:53Z","cross_cats_sorted":[],"title_canon_sha256":"687fe6af475cd75dbaec8fa8bc8f39253f572d069b47ae333b408d1cc9b2aac1","abstract_canon_sha256":"159d1258a07df9f1e136f41323c7235d61f608e2c1fe34b67befc197c40e3422"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:02:14.403905Z","signature_b64":"k3mrAllcd1B7tylpD0FCzIEbnFT77TFmfad9W2/Fw40rGciJnjX0HS5K4fiiKGVhT+q5aGutM2/yG6ZGBSHbBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8401866196bb01fa6863ec20b3c14ab034de1520004bdff98ad2b88d84a01e11","last_reissued_at":"2026-05-18T01:02:14.403132Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:02:14.403132Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Adjacency Matrices and Descriptors of Signed Cycle Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"A.M. Mathai, Thomas Zaslavsky","submitted_at":"2013-03-13T03:33:53Z","abstract_excerpt":"This paper deals with adjacency matrices of signed cycle graphs and chemical descriptors based on them. The eigenvalues and eigenvectors of the matrices are calculated and their efficacy in classifying different signed cycles is determined. The efficacy of some numerical indices is also examined."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.3082","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":"1303.3082","created_at":"2026-05-18T01:02:14.403252+00:00"},{"alias_kind":"arxiv_version","alias_value":"1303.3082v1","created_at":"2026-05-18T01:02:14.403252+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.3082","created_at":"2026-05-18T01:02:14.403252+00:00"},{"alias_kind":"pith_short_12","alias_value":"QQAYMYMWXMA7","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_16","alias_value":"QQAYMYMWXMA7U2DD","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_8","alias_value":"QQAYMYMW","created_at":"2026-05-18T12:27:57.521954+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/QQAYMYMWXMA7U2DD5QQLHQKKWA","json":"https://pith.science/pith/QQAYMYMWXMA7U2DD5QQLHQKKWA.json","graph_json":"https://pith.science/api/pith-number/QQAYMYMWXMA7U2DD5QQLHQKKWA/graph.json","events_json":"https://pith.science/api/pith-number/QQAYMYMWXMA7U2DD5QQLHQKKWA/events.json","paper":"https://pith.science/paper/QQAYMYMW"},"agent_actions":{"view_html":"https://pith.science/pith/QQAYMYMWXMA7U2DD5QQLHQKKWA","download_json":"https://pith.science/pith/QQAYMYMWXMA7U2DD5QQLHQKKWA.json","view_paper":"https://pith.science/paper/QQAYMYMW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1303.3082&json=true","fetch_graph":"https://pith.science/api/pith-number/QQAYMYMWXMA7U2DD5QQLHQKKWA/graph.json","fetch_events":"https://pith.science/api/pith-number/QQAYMYMWXMA7U2DD5QQLHQKKWA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QQAYMYMWXMA7U2DD5QQLHQKKWA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QQAYMYMWXMA7U2DD5QQLHQKKWA/action/storage_attestation","attest_author":"https://pith.science/pith/QQAYMYMWXMA7U2DD5QQLHQKKWA/action/author_attestation","sign_citation":"https://pith.science/pith/QQAYMYMWXMA7U2DD5QQLHQKKWA/action/citation_signature","submit_replication":"https://pith.science/pith/QQAYMYMWXMA7U2DD5QQLHQKKWA/action/replication_record"}},"created_at":"2026-05-18T01:02:14.403252+00:00","updated_at":"2026-05-18T01:02:14.403252+00:00"}