{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:GA5JTWJM47K6R5SAYZUVLYKOFU","short_pith_number":"pith:GA5JTWJM","schema_version":"1.0","canonical_sha256":"303a99d92ce7d5e8f640c66955e14e2d192d698e82c2186c80a3d6f17ad75d5b","source":{"kind":"arxiv","id":"0807.1052","version":1},"attestation_state":"computed","paper":{"title":"Compact $AC(\\sigma)$ operators","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.FA","authors_text":"Brenden Ashton, Ian Doust","submitted_at":"2008-07-07T15:48:37Z","abstract_excerpt":"All compact $AC(\\sigma)$ operators have a representation analogous to that for compact normal operators. As a partial converse we obtain conditions which allow one to construct a large number of such operators. Using the results in the paper, we answer a number of questions about the decomposition of a compact $AC(\\sigma)$ into real and imaginary parts."},"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":"0807.1052","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.FA","submitted_at":"2008-07-07T15:48:37Z","cross_cats_sorted":[],"title_canon_sha256":"29d8dd38dabd8a279f44b1d2f75f72c582faee85d515d89f809597cfa18a1b36","abstract_canon_sha256":"5d0639053706d7a95b6ac3cc4c1a829cc47e3fc0fc4fc9b2831aa6d4eb0fd6d3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:19:23.547525Z","signature_b64":"U6B/aX2VPa8hvTHsm0A7w+YztsXlJ5iXZqg1GzvqZ7ZXRSOeWa4boDRWWhbdX2PwMOeZ9KK12qQ+OL0KeqCpCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"303a99d92ce7d5e8f640c66955e14e2d192d698e82c2186c80a3d6f17ad75d5b","last_reissued_at":"2026-05-18T04:19:23.547168Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:19:23.547168Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Compact $AC(\\sigma)$ operators","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.FA","authors_text":"Brenden Ashton, Ian Doust","submitted_at":"2008-07-07T15:48:37Z","abstract_excerpt":"All compact $AC(\\sigma)$ operators have a representation analogous to that for compact normal operators. As a partial converse we obtain conditions which allow one to construct a large number of such operators. Using the results in the paper, we answer a number of questions about the decomposition of a compact $AC(\\sigma)$ into real and imaginary parts."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0807.1052","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":"0807.1052","created_at":"2026-05-18T04:19:23.547216+00:00"},{"alias_kind":"arxiv_version","alias_value":"0807.1052v1","created_at":"2026-05-18T04:19:23.547216+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0807.1052","created_at":"2026-05-18T04:19:23.547216+00:00"},{"alias_kind":"pith_short_12","alias_value":"GA5JTWJM47K6","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_16","alias_value":"GA5JTWJM47K6R5SA","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_8","alias_value":"GA5JTWJM","created_at":"2026-05-18T12:25:57.157939+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/GA5JTWJM47K6R5SAYZUVLYKOFU","json":"https://pith.science/pith/GA5JTWJM47K6R5SAYZUVLYKOFU.json","graph_json":"https://pith.science/api/pith-number/GA5JTWJM47K6R5SAYZUVLYKOFU/graph.json","events_json":"https://pith.science/api/pith-number/GA5JTWJM47K6R5SAYZUVLYKOFU/events.json","paper":"https://pith.science/paper/GA5JTWJM"},"agent_actions":{"view_html":"https://pith.science/pith/GA5JTWJM47K6R5SAYZUVLYKOFU","download_json":"https://pith.science/pith/GA5JTWJM47K6R5SAYZUVLYKOFU.json","view_paper":"https://pith.science/paper/GA5JTWJM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0807.1052&json=true","fetch_graph":"https://pith.science/api/pith-number/GA5JTWJM47K6R5SAYZUVLYKOFU/graph.json","fetch_events":"https://pith.science/api/pith-number/GA5JTWJM47K6R5SAYZUVLYKOFU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GA5JTWJM47K6R5SAYZUVLYKOFU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GA5JTWJM47K6R5SAYZUVLYKOFU/action/storage_attestation","attest_author":"https://pith.science/pith/GA5JTWJM47K6R5SAYZUVLYKOFU/action/author_attestation","sign_citation":"https://pith.science/pith/GA5JTWJM47K6R5SAYZUVLYKOFU/action/citation_signature","submit_replication":"https://pith.science/pith/GA5JTWJM47K6R5SAYZUVLYKOFU/action/replication_record"}},"created_at":"2026-05-18T04:19:23.547216+00:00","updated_at":"2026-05-18T04:19:23.547216+00:00"}