{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:2F6BTSMBKKJNKVBH36RD24FX3M","short_pith_number":"pith:2F6BTSMB","schema_version":"1.0","canonical_sha256":"d17c19c9815292d55427dfa23d70b7db1ef23ae31bb57cba93ca1922420f2837","source":{"kind":"arxiv","id":"1811.03061","version":1},"attestation_state":"computed","paper":{"title":"An explicit formula for the distance characteristic polynomial of threshold graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Fernando C. Tura, Joao Lazzarin, Oscar F. Marquez","submitted_at":"2018-11-07T18:22:46Z","abstract_excerpt":"A threshold graph G on n vertices is defined by binary sequence of length n. In this paper we present an explicit formula for computing the distance characteristic polynomial of a threshold graph from its binary sequence. As application, we show a several of nonisomorphic pairwise threshold graphs which are {D}-cospectral graphs."},"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":"1811.03061","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-11-07T18:22:46Z","cross_cats_sorted":[],"title_canon_sha256":"2b2d48259f33acfb76e9792e0a4b5f81720fe6147f131fed36ddbe42ef75e6c9","abstract_canon_sha256":"24f2f61bd52d7952748f6cde19a7fda2b565f63fe4c59f5fdfdbaa1b657b7249"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:20.033488Z","signature_b64":"019OTUznyNzdz4ySxkarsd8yUbGgN0sK7+6aNJ5TV0+ZQ4YF+7xPd1Dgcjhj2FDE5B+divz81sswkgZl1AO+Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d17c19c9815292d55427dfa23d70b7db1ef23ae31bb57cba93ca1922420f2837","last_reissued_at":"2026-05-18T00:01:20.033018Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:20.033018Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An explicit formula for the distance characteristic polynomial of threshold graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Fernando C. Tura, Joao Lazzarin, Oscar F. Marquez","submitted_at":"2018-11-07T18:22:46Z","abstract_excerpt":"A threshold graph G on n vertices is defined by binary sequence of length n. In this paper we present an explicit formula for computing the distance characteristic polynomial of a threshold graph from its binary sequence. As application, we show a several of nonisomorphic pairwise threshold graphs which are {D}-cospectral graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.03061","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":"1811.03061","created_at":"2026-05-18T00:01:20.033082+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.03061v1","created_at":"2026-05-18T00:01:20.033082+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.03061","created_at":"2026-05-18T00:01:20.033082+00:00"},{"alias_kind":"pith_short_12","alias_value":"2F6BTSMBKKJN","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_16","alias_value":"2F6BTSMBKKJNKVBH","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_8","alias_value":"2F6BTSMB","created_at":"2026-05-18T12:32:02.567920+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/2F6BTSMBKKJNKVBH36RD24FX3M","json":"https://pith.science/pith/2F6BTSMBKKJNKVBH36RD24FX3M.json","graph_json":"https://pith.science/api/pith-number/2F6BTSMBKKJNKVBH36RD24FX3M/graph.json","events_json":"https://pith.science/api/pith-number/2F6BTSMBKKJNKVBH36RD24FX3M/events.json","paper":"https://pith.science/paper/2F6BTSMB"},"agent_actions":{"view_html":"https://pith.science/pith/2F6BTSMBKKJNKVBH36RD24FX3M","download_json":"https://pith.science/pith/2F6BTSMBKKJNKVBH36RD24FX3M.json","view_paper":"https://pith.science/paper/2F6BTSMB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.03061&json=true","fetch_graph":"https://pith.science/api/pith-number/2F6BTSMBKKJNKVBH36RD24FX3M/graph.json","fetch_events":"https://pith.science/api/pith-number/2F6BTSMBKKJNKVBH36RD24FX3M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2F6BTSMBKKJNKVBH36RD24FX3M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2F6BTSMBKKJNKVBH36RD24FX3M/action/storage_attestation","attest_author":"https://pith.science/pith/2F6BTSMBKKJNKVBH36RD24FX3M/action/author_attestation","sign_citation":"https://pith.science/pith/2F6BTSMBKKJNKVBH36RD24FX3M/action/citation_signature","submit_replication":"https://pith.science/pith/2F6BTSMBKKJNKVBH36RD24FX3M/action/replication_record"}},"created_at":"2026-05-18T00:01:20.033082+00:00","updated_at":"2026-05-18T00:01:20.033082+00:00"}