{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:XRJWCI34G44K45JSID62ODTTEQ","short_pith_number":"pith:XRJWCI34","schema_version":"1.0","canonical_sha256":"bc5361237c3738ae753240fda70e73241733ec7bb8a913be27e87606a6b06456","source":{"kind":"arxiv","id":"1708.02438","version":2},"attestation_state":"computed","paper":{"title":"Ordered multiplicity inverse eigenvalue problem for graphs on six vertices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Audrey Goodnight, Beth Bjorkman, Casandra Monroe, Christine Alar, Haley Knox, John Ahn, Joshua Carlson, Michael C. Wigal, Steve Butler","submitted_at":"2017-08-08T10:23:08Z","abstract_excerpt":"For a graph $G$, we associate a family of real symmetric matrices, $\\mathcal{S}(G)$, where for any $M \\in \\mathcal{S}(G)$, the location of the nonzero off-diagonal entries of $M$ are governed by the adjacency structure of $G$. The ordered multiplicity Inverse Eigenvalue Problem of a Graph (IEPG) is concerned with finding all attainable ordered lists of eigenvalue multiplicities for matrices in $\\mathcal{S}(G)$.\n  For connected graphs of order six, we offer significant progress on the IEPG, as well as a complete solution to the ordered multiplicity IEPG. We also show that while $K_{m,n}$ with $"},"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":"1708.02438","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-08T10:23:08Z","cross_cats_sorted":[],"title_canon_sha256":"7e1f6980e4f8aa38cd861e7dd1852f3d65cc5e216a4c41e64ac16a38579de3c7","abstract_canon_sha256":"f6a97333bf15ebce73a6ebfb8d0841a86e328047634d280da1188fa268458cf0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:31.797437Z","signature_b64":"3xX2BLbQHEznfOYzTBr8tvGlYPm6kkmALPHeMKl4BERfobG8ddW0aEEEf8G6sEy52GOfFODaGM7kwIGWTI+rBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bc5361237c3738ae753240fda70e73241733ec7bb8a913be27e87606a6b06456","last_reissued_at":"2026-05-18T00:33:31.796914Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:31.796914Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Ordered multiplicity inverse eigenvalue problem for graphs on six vertices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Audrey Goodnight, Beth Bjorkman, Casandra Monroe, Christine Alar, Haley Knox, John Ahn, Joshua Carlson, Michael C. Wigal, Steve Butler","submitted_at":"2017-08-08T10:23:08Z","abstract_excerpt":"For a graph $G$, we associate a family of real symmetric matrices, $\\mathcal{S}(G)$, where for any $M \\in \\mathcal{S}(G)$, the location of the nonzero off-diagonal entries of $M$ are governed by the adjacency structure of $G$. The ordered multiplicity Inverse Eigenvalue Problem of a Graph (IEPG) is concerned with finding all attainable ordered lists of eigenvalue multiplicities for matrices in $\\mathcal{S}(G)$.\n  For connected graphs of order six, we offer significant progress on the IEPG, as well as a complete solution to the ordered multiplicity IEPG. We also show that while $K_{m,n}$ with $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.02438","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":"1708.02438","created_at":"2026-05-18T00:33:31.796997+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.02438v2","created_at":"2026-05-18T00:33:31.796997+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.02438","created_at":"2026-05-18T00:33:31.796997+00:00"},{"alias_kind":"pith_short_12","alias_value":"XRJWCI34G44K","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_16","alias_value":"XRJWCI34G44K45JS","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_8","alias_value":"XRJWCI34","created_at":"2026-05-18T12:31:56.362134+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/XRJWCI34G44K45JSID62ODTTEQ","json":"https://pith.science/pith/XRJWCI34G44K45JSID62ODTTEQ.json","graph_json":"https://pith.science/api/pith-number/XRJWCI34G44K45JSID62ODTTEQ/graph.json","events_json":"https://pith.science/api/pith-number/XRJWCI34G44K45JSID62ODTTEQ/events.json","paper":"https://pith.science/paper/XRJWCI34"},"agent_actions":{"view_html":"https://pith.science/pith/XRJWCI34G44K45JSID62ODTTEQ","download_json":"https://pith.science/pith/XRJWCI34G44K45JSID62ODTTEQ.json","view_paper":"https://pith.science/paper/XRJWCI34","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.02438&json=true","fetch_graph":"https://pith.science/api/pith-number/XRJWCI34G44K45JSID62ODTTEQ/graph.json","fetch_events":"https://pith.science/api/pith-number/XRJWCI34G44K45JSID62ODTTEQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XRJWCI34G44K45JSID62ODTTEQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XRJWCI34G44K45JSID62ODTTEQ/action/storage_attestation","attest_author":"https://pith.science/pith/XRJWCI34G44K45JSID62ODTTEQ/action/author_attestation","sign_citation":"https://pith.science/pith/XRJWCI34G44K45JSID62ODTTEQ/action/citation_signature","submit_replication":"https://pith.science/pith/XRJWCI34G44K45JSID62ODTTEQ/action/replication_record"}},"created_at":"2026-05-18T00:33:31.796997+00:00","updated_at":"2026-05-18T00:33:31.796997+00:00"}